Base | Representation |
---|---|
bin | 1001100110101011000100… |
… | …01110010001001101010101 |
3 | 2202210001102021000100011211 |
4 | 10303111202032101031111 |
5 | 10232012231014231401 |
6 | 112530221154101421 |
7 | 4306604224556620 |
oct | 463254216211525 |
9 | 82701367010154 |
10 | 21120002102101 |
11 | 6802a40653421 |
12 | 2451245b7a871 |
13 | ba27b9021686 |
14 | 5302dbdd6db7 |
15 | 2695a686a951 |
hex | 133562391355 |
21120002102101 has 8 divisors (see below), whose sum is σ = 24138309727424. Its totient is φ = 18101985593760.
The previous prime is 21120002102039. The next prime is 21120002102179. The reversal of 21120002102101 is 10120120002112.
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 21120002102101 - 213 = 21120002093909 is a prime.
It is a super-2 number, since 2×211200021021012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21120002102201) 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, 72623760 + ... + 72913993.
It is an arithmetic number, because the mean of its divisors is an integer number (3017288715928).
Almost surely, 221120002102101 is an apocalyptic number.
It is an amenable number.
21120002102101 is a deficient number, since it is larger than the sum of its proper divisors (3018307625323).
21120002102101 is a wasteful number, since it uses less digits than its factorization.
21120002102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145558491.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21120002102101 its reverse (10120120002112), we get a palindrome (31240122104213).
The spelling of 21120002102101 in words is "twenty-one trillion, one hundred twenty billion, two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •