Base | Representation |
---|---|
bin | 1001100011110011000011… |
… | …10000010110100111000101 |
3 | 2202102121102021021011221112 |
4 | 10301321201300112213011 |
5 | 10223402414230341401 |
6 | 112413002140454405 |
7 | 4266506115632615 |
oct | 461714160264705 |
9 | 82377367234845 |
10 | 21021210012101 |
11 | 6775055036a52 |
12 | 243607484a405 |
13 | b963a38458a0 |
14 | 529609564a45 |
15 | 266c236d03bb |
hex | 131e61c169c5 |
21021210012101 has 8 divisors (see below), whose sum is σ = 22638508698624. Its totient is φ = 19403951687280.
The previous prime is 21021210012097. The next prime is 21021210012113. The reversal of 21021210012101 is 10121001212012.
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 21021210012101 - 22 = 21021210012097 is a prime.
It is a super-3 number, since 3×210212100121013 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21021210012401) 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, 9004385 + ... + 11096006.
It is an arithmetic number, because the mean of its divisors is an integer number (2829813587328).
Almost surely, 221021210012101 is an apocalyptic number.
It is an amenable number.
21021210012101 is a deficient number, since it is larger than the sum of its proper divisors (1617298686523).
21021210012101 is a wasteful number, since it uses less digits than its factorization.
21021210012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20180851.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 21021210012101 its reverse (10121001212012), we get a palindrome (31142211224113).
The spelling of 21021210012101 in words is "twenty-one trillion, twenty-one billion, two hundred ten million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •