Base | Representation |
---|---|
bin | 1001010010000101111001… |
… | …0110001000101011011100 |
3 | 1100010201120022120200211020 |
4 | 2110201132112020223130 |
5 | 2314210224320000231 |
6 | 33412433400324140 |
7 | 2102250505254414 |
oct | 224413626105334 |
9 | 40121508520736 |
10 | 10206425156316 |
11 | 328557aa13264 |
12 | 118a0a7173650 |
13 | 59060065212c |
14 | 273dca691644 |
15 | 12a75c4d2396 |
hex | 9485e588adc |
10206425156316 has 96 divisors (see below), whose sum is σ = 25096467422208. Its totient is φ = 3222014906880.
The previous prime is 10206425156237. The next prime is 10206425156329. The reversal of 10206425156316 is 61365152460201.
It is a super-2 number, since 2×102064251563162 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 163060146 + ... + 163122726.
It is an arithmetic number, because the mean of its divisors is an integer number (261421535648).
Almost surely, 210206425156316 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 10206425156316, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12548233711104).
10206425156316 is an abundant number, since it is smaller than the sum of its proper divisors (14890042265892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206425156316 is a wasteful number, since it uses less digits than its factorization.
10206425156316 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68451 (or 68449 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 10206425156316 in words is "ten trillion, two hundred six billion, four hundred twenty-five million, one hundred fifty-six thousand, three hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •