Base | Representation |
---|---|
bin | 11110110000000111001… |
… | …10101011001111000110 |
3 | 10202000022211111122102000 |
4 | 33120003212223033012 |
5 | 114302430320100110 |
6 | 2125223341330130 |
7 | 136224042265254 |
oct | 17300346531706 |
9 | 3660284448360 |
10 | 1056622425030 |
11 | 3781248a3987 |
12 | 150944866946 |
13 | 78840052053 |
14 | 391d84c95d4 |
15 | 1c7426e11c0 |
hex | f6039ab3c6 |
1056622425030 has 64 divisors (see below), whose sum is σ = 2827832057280. Its totient is φ = 280748754432.
The previous prime is 1056622424987. The next prime is 1056622425037. The reversal of 1056622425030 is 305242266501.
1056622425030 is a `hidden beast` number, since 1 + 0 + 5 + 6 + 622 + 4 + 25 + 0 + 3 + 0 = 666.
It is a super-2 number, since 2×10566224250302 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056622425037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6989139 + ... + 7138718.
It is an arithmetic number, because the mean of its divisors is an integer number (44184875895).
Almost surely, 21056622425030 is an apocalyptic number.
1056622425030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1056622425030 is an abundant number, since it is smaller than the sum of its proper divisors (1771209632250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056622425030 is a wasteful number, since it uses less digits than its factorization.
1056622425030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14128150 (or 14128144 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 1056622425030 in words is "one trillion, fifty-six billion, six hundred twenty-two million, four hundred twenty-five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.362 sec. • engine limits •