Base | Representation |
---|---|
bin | 1001001100100010110111… |
… | …1010011101000101111100 |
3 | 1022210121120120100102222101 |
4 | 2103020231322131011330 |
5 | 2311130040032004040 |
6 | 33300552543154444 |
7 | 2062335030045652 |
oct | 223105572350574 |
9 | 38717516312871 |
10 | 10111123313020 |
11 | 32491155718a4 |
12 | 117372a8a5a24 |
13 | 5846232a9492 |
14 | 26d54959cdd2 |
15 | 12803097909a |
hex | 9322de9d17c |
10111123313020 has 12 divisors (see below), whose sum is σ = 21233358957384. Its totient is φ = 4044449325200.
The previous prime is 10111123312957. The next prime is 10111123313089. The reversal of 10111123313020 is 2031332111101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252778082806 + ... + 252778082845.
It is an arithmetic number, because the mean of its divisors is an integer number (1769446579782).
Almost surely, 210111123313020 is an apocalyptic number.
10111123313020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111123313020 is an abundant number, since it is smaller than the sum of its proper divisors (11122235644364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111123313020 is a wasteful number, since it uses less digits than its factorization.
10111123313020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505556165660 (or 505556165658 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10111123313020 its reverse (2031332111101), we get a palindrome (12142455424121).
The spelling of 10111123313020 in words is "ten trillion, one hundred eleven billion, one hundred twenty-three million, three hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •