Base | Representation |
---|---|
bin | 11110101111010000000… |
… | …101011010001100110101 |
3 | 21110221021012210010021000 |
4 | 132233100011122030311 |
5 | 234102012411140201 |
6 | 4254215244513513 |
7 | 305416154635020 |
oct | 36572005321465 |
9 | 7427235703230 |
10 | 2112320021301 |
11 | 744914647276 |
12 | 2a146b84b899 |
13 | 1242635c6439 |
14 | 74345c341b7 |
15 | 39e2daedd86 |
hex | 1ebd015a335 |
2112320021301 has 64 divisors (see below), whose sum is σ = 3588299827200. Its totient is φ = 1203031968768.
The previous prime is 2112320021239. The next prime is 2112320021303. The reversal of 2112320021301 is 1031200232112.
2112320021301 is a `hidden beast` number, since 21 + 1 + 2 + 320 + 0 + 21 + 301 = 666.
It is not a de Polignac number, because 2112320021301 - 210 = 2112320020277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112320021303) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 186446805 + ... + 186458133.
It is an arithmetic number, because the mean of its divisors is an integer number (56067184800).
Almost surely, 22112320021301 is an apocalyptic number.
2112320021301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2112320021301 is a deficient number, since it is larger than the sum of its proper divisors (1475979805899).
2112320021301 is a wasteful number, since it uses less digits than its factorization.
2112320021301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14535 (or 14529 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2112320021301 its reverse (1031200232112), we get a palindrome (3143520253413).
The spelling of 2112320021301 in words is "two trillion, one hundred twelve billion, three hundred twenty million, twenty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •