Base | Representation |
---|---|
bin | 1001100011110010110111… |
… | …10010110101100110000001 |
3 | 2202102121011022002001010200 |
4 | 10301321123302311212001 |
5 | 10223402213130000001 |
6 | 112412544205115413 |
7 | 4266503462560266 |
oct | 461713362654601 |
9 | 82377138061120 |
10 | 21021110000001 |
11 | 6775003637421 |
12 | 2436047258b69 |
13 | b96388bc9727 |
14 | 5295da16d26d |
15 | 266c19a27086 |
hex | 131e5bcb5981 |
21021110000001 has 48 divisors (see below), whose sum is σ = 33726982124160. Its totient is φ = 12555533329920.
The previous prime is 21021109999991. The next prime is 21021110000039. The reversal of 21021110000001 is 10000001112012.
It is a happy number.
It is not a de Polignac number, because 21021110000001 - 25 = 21021109999969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (21021110000071) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 33048955 + ... + 33679008.
It is an arithmetic number, because the mean of its divisors is an integer number (702645460920).
Almost surely, 221021110000001 is an apocalyptic number.
It is an amenable number.
21021110000001 is a deficient number, since it is larger than the sum of its proper divisors (12705872124159).
21021110000001 is a wasteful number, since it uses less digits than its factorization.
21021110000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66728086 (or 66728083 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 21021110000001 its reverse (10000001112012), we get a palindrome (31021111112013).
The spelling of 21021110000001 in words is "twenty-one trillion, twenty-one billion, one hundred ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •