Base | Representation |
---|---|
bin | 11110101111001001101… |
… | …00111001100011100000 |
3 | 10201221222211212120202021 |
4 | 33113210310321203200 |
5 | 114300401122410000 |
6 | 2125100214031224 |
7 | 136205202251665 |
oct | 17274464714340 |
9 | 3657884776667 |
10 | 1056106060000 |
11 | 37798a37a222 |
12 | 15081b948514 |
13 | 7878a08a204 |
14 | 39189ab3a6c |
15 | 1c7121e411a |
hex | f5e4d398e0 |
1056106060000 has 60 divisors (see below), whose sum is σ = 2598179372712. Its totient is φ = 422442416000.
The previous prime is 1056106059997. The next prime is 1056106060001. The reversal of 1056106060000 is 606016501.
It is a super-2 number, since 2×10561060600002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056106060001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 26382652 + ... + 26422651.
Almost surely, 21056106060000 is an apocalyptic number.
1056106060000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1056106060000 is an abundant number, since it is smaller than the sum of its proper divisors (1542073312712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1056106060000 is an frugal number, since it uses more digits than its factorization.
1056106060000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52805333 (or 52805310 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The spelling of 1056106060000 in words is "one trillion, fifty-six billion, one hundred six million, sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •