Base | Representation |
---|---|
bin | 11110101100100110010… |
… | …00010110100110100000 |
3 | 10201211110022210021010010 |
4 | 33112103020112212200 |
5 | 114240044232144000 |
6 | 2124312212404520 |
7 | 136126220133222 |
oct | 17262310264640 |
9 | 3654408707103 |
10 | 1054735428000 |
11 | 37734671a101 |
12 | 1504b8916740 |
13 | 785cc121b67 |
14 | 39099a48412 |
15 | 1c681c00d50 |
hex | f5932169a0 |
1054735428000 has 96 divisors (see below), whose sum is σ = 3455313301440. Its totient is φ = 281262777600.
The previous prime is 1054735427989. The next prime is 1054735428059. The reversal of 1054735428000 is 8245374501.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×10547354280002 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1054735428000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43935310 + ... + 43959309.
It is an arithmetic number, because the mean of its divisors is an integer number (35992846890).
Almost surely, 21054735428000 is an apocalyptic number.
1054735428000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1054735428000 is an abundant number, since it is smaller than the sum of its proper divisors (2400577873440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054735428000 is an equidigital number, since it uses as much as digits as its factorization.
1054735428000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87894647 (or 87894629 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 39.
The spelling of 1054735428000 in words is "one trillion, fifty-four billion, seven hundred thirty-five million, four hundred twenty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •