Base | Representation |
---|---|
bin | 1001100011001101111111… |
… | …01111111000110111101000 |
3 | 2202100201001112212010120101 |
4 | 10301212333233320313220 |
5 | 10223041141400041404 |
6 | 112355511455435144 |
7 | 4265203043365432 |
oct | 461467757706750 |
9 | 82321045763511 |
10 | 21001312112104 |
11 | 67676742031a5 |
12 | 2432240b25ab4 |
13 | b9455236856c |
14 | 52867ca59652 |
15 | 26645b8d12a4 |
hex | 1319bfbf8de8 |
21001312112104 has 32 divisors (see below), whose sum is σ = 41732784289800. Its totient is φ = 9873725276160.
The previous prime is 21001312112101. The next prime is 21001312112107. The reversal of 21001312112104 is 40121121310012.
It is an interprime number because it is at equal distance from previous prime (21001312112101) and next prime (21001312112107).
It can be written as a sum of positive squares in 4 ways, for example, as 18365527392004 + 2635784720100 = 4285502^2 + 1623510^2 .
It is a super-2 number, since 2×210013121121042 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21001312112101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72081657 + ... + 72372424.
Almost surely, 221001312112104 is an apocalyptic number.
It is an amenable number.
21001312112104 is a deficient number, since it is larger than the sum of its proper divisors (20731472177696).
21001312112104 is a wasteful number, since it uses less digits than its factorization.
21001312112104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144455173 (or 144455169 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 21001312112104 its reverse (40121121310012), we get a palindrome (61122433422116).
The spelling of 21001312112104 in words is "twenty-one trillion, one billion, three hundred twelve million, one hundred twelve thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •