Base | Representation |
---|---|
bin | 11110101111101111111… |
… | …11011101100010000000 |
3 | 10201222211020220022002110 |
4 | 33113313333131202000 |
5 | 114302030431032104 |
6 | 2125152141415320 |
7 | 136216155255312 |
oct | 17276777354200 |
9 | 3658736808073 |
10 | 1056427595904 |
11 | 37803492297a |
12 | 1508ab56a540 |
13 | 7880b888545 |
14 | 391ba6917b2 |
15 | 1c730558e89 |
hex | f5f7fdd880 |
1056427595904 has 128 divisors (see below), whose sum is σ = 2954478225600. Its totient is φ = 333535186944.
The previous prime is 1056427595887. The next prime is 1056427595917. The reversal of 1056427595904 is 4095957246501.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-2 number, since 2×10564275959042 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (57).
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, 39946974 + ... + 39973410.
Almost surely, 21056427595904 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1056427595904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1477239112800).
1056427595904 is an abundant number, since it is smaller than the sum of its proper divisors (1898050629696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056427595904 is a wasteful number, since it uses less digits than its factorization.
1056427595904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31950 (or 31938 counting only the distinct ones).
The product of its (nonzero) digits is 13608000, while the sum is 57.
The spelling of 1056427595904 in words is "one trillion, fifty-six billion, four hundred twenty-seven million, five hundred ninety-five thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •