Base | Representation |
---|---|
bin | 1000010011110011000… |
… | …00100001110000110000 |
3 | 1000021221102200110010120 |
4 | 10021321200201300300 |
5 | 14134204120132233 |
6 | 335054305130240 |
7 | 26425054312440 |
oct | 4117140416060 |
9 | 1007842613116 |
10 | 285506411568 |
11 | 10009aa20844 |
12 | 473bb629980 |
13 | 20c001a1091 |
14 | db662a2120 |
15 | 766007c4b3 |
hex | 4279821c30 |
285506411568 has 80 divisors (see below), whose sum is σ = 843062516736. Its totient is φ = 81559825920.
The previous prime is 285506411563. The next prime is 285506411569. The reversal of 285506411568 is 865114605582.
It is a super-2 number, since 2×2855064115682 (a number of 24 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 285506411568.
It is not an unprimeable number, because it can be changed into a prime (285506411563) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2070505 + ... + 2204087.
Almost surely, 2285506411568 is an apocalyptic number.
285506411568 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
285506411568 is an abundant number, since it is smaller than the sum of its proper divisors (557556105168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
285506411568 is a wasteful number, since it uses less digits than its factorization.
285506411568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139962 (or 139956 counting only the distinct ones).
The product of its (nonzero) digits is 2304000, while the sum is 51.
The spelling of 285506411568 in words is "two hundred eighty-five billion, five hundred six million, four hundred eleven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •