Base | Representation |
---|---|
bin | 1001010111100110010011… |
… | …0100101001110001100000 |
3 | 1100110202202000022010221002 |
4 | 2111321210310221301200 |
5 | 2322232443403200000 |
6 | 33524120310451132 |
7 | 2112136645440533 |
oct | 225714464516140 |
9 | 40422660263832 |
10 | 10301023100000 |
11 | 3311703aa1506 |
12 | 11a44a7963aa8 |
13 | 5994c7c21739 |
14 | 2788020b2a1a |
15 | 12ce473478d5 |
hex | 95e64d29c60 |
10301023100000 has 72 divisors (see below), whose sum is σ = 25348551870096. Its totient is φ = 4120409200000.
The previous prime is 10301023099979. The next prime is 10301023100003. The reversal of 10301023100000 is 132010301.
It is a super-2 number, since 2×103010231000002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301023100003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51405116 + ... + 51605115.
It is an arithmetic number, because the mean of its divisors is an integer number (352063220418).
Almost surely, 210301023100000 is an apocalyptic number.
10301023100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10301023100000 is an abundant number, since it is smaller than the sum of its proper divisors (15047528770096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301023100000 is an frugal number, since it uses more digits than its factorization.
10301023100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103010266 (or 103010238 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 10301023100000 its reverse (132010301), we get a palindrome (10301155110301).
The spelling of 10301023100000 in words is "ten trillion, three hundred one billion, twenty-three million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •