Base | Representation |
---|---|
bin | 1001100110011000011101… |
… | …10001000011111011010001 |
3 | 2202202002122000212200011102 |
4 | 10303030032301003323101 |
5 | 10231331301033031001 |
6 | 112521450003354145 |
7 | 4306101530246426 |
oct | 463141661037321 |
9 | 82662560780142 |
10 | 21110012002001 |
11 | 67a978449034a |
12 | 244b318382955 |
13 | ba18863bc340 |
14 | 52da312cdd4d |
15 | 2691be7b5e6b |
hex | 13330ec43ed1 |
21110012002001 has 8 divisors (see below), whose sum is σ = 22734125869224. Its totient is φ = 19485936247680.
The previous prime is 21110012001979. The next prime is 21110012002021. The reversal of 21110012002001 is 10020021001112.
It can be written as a sum of positive squares in 4 ways, for example, as 950352019600 + 20159659982401 = 974860^2 + 4489951^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21110012002001 - 218 = 21110011739857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21110012002021) 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, 8372660 + ... + 10598181.
It is an arithmetic number, because the mean of its divisors is an integer number (2841765733653).
Almost surely, 221110012002001 is an apocalyptic number.
It is an amenable number.
21110012002001 is a deficient number, since it is larger than the sum of its proper divisors (1624113867223).
21110012002001 is a wasteful number, since it uses less digits than its factorization.
21110012002001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19056451.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21110012002001 its reverse (10020021001112), we get a palindrome (31130033003113).
The spelling of 21110012002001 in words is "twenty-one trillion, one hundred ten billion, twelve million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •