Base | Representation |
---|---|
bin | 1001100110011100010110… |
… | …01110001011100000010001 |
3 | 2202202022000112211110200001 |
4 | 10303032023032023200101 |
5 | 10231400040100310001 |
6 | 112522433112530001 |
7 | 4306204343106340 |
oct | 463161316134021 |
9 | 82668015743601 |
10 | 21112100010001 |
11 | 67aa6560786a0 |
12 | 244b7bb6b0901 |
13 | ba1b29b6ba30 |
14 | 52db8c737b57 |
15 | 269292c60001 |
hex | 13338b38b811 |
21112100010001 has 16 divisors (see below), whose sum is σ = 28346316098688. Its totient is φ = 15185526480000.
The previous prime is 21112100009887. The next prime is 21112100010007. The reversal of 21112100010001 is 10001000121112.
It is a cyclic number.
It is not a de Polignac number, because 21112100010001 - 223 = 21112091621393 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21112100010001.
It is not an unprimeable number, because it can be changed into a prime (21112100010007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10545503500 + ... + 10545505501.
It is an arithmetic number, because the mean of its divisors is an integer number (1771644756168).
Almost surely, 221112100010001 is an apocalyptic number.
It is an amenable number.
21112100010001 is a deficient number, since it is larger than the sum of its proper divisors (7234216088687).
21112100010001 is a wasteful number, since it uses less digits than its factorization.
21112100010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21091009032.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 21112100010001 its reverse (10001000121112), we get a palindrome (31113100131113).
It can be divided in two parts, 21112 and 100010001, that multiplied together give a palindrome (2111411141112).
The spelling of 21112100010001 in words is "twenty-one trillion, one hundred twelve billion, one hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •