Base | Representation |
---|---|
bin | 11011010011111110101010… |
… | …011101011100010100000101 |
3 | 120202022101020222111112020021 |
4 | 123103332222131130110011 |
5 | 111221022142303241401 |
6 | 1103250243542535141 |
7 | 34205253534135631 |
oct | 3323765235342405 |
9 | 522271228445207 |
10 | 120120210212101 |
11 | 35301771156840 |
12 | 115801274374b1 |
13 | 52043970355a8 |
14 | 2193bc6295dc1 |
15 | dd4907cd12a1 |
hex | 6d3faa75c505 |
120120210212101 has 16 divisors (see below), whose sum is σ = 132339715296768. Its totient is φ = 108117319752000.
The previous prime is 120120210212083. The next prime is 120120210212143. The reversal of 120120210212101 is 101212012021021.
It is a cyclic number.
It is not a de Polignac number, because 120120210212101 - 27 = 120120210211973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120120210212201) 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, 73599820 + ... + 75214186.
It is an arithmetic number, because the mean of its divisors is an integer number (8271232206048).
Almost surely, 2120120210212101 is an apocalyptic number.
120120210212101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120120210212101 is a deficient number, since it is larger than the sum of its proper divisors (12219505084667).
120120210212101 is a wasteful number, since it uses less digits than its factorization.
120120210212101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1681452.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 120120210212101 its reverse (101212012021021), we get a palindrome (221332222233122).
The spelling of 120120210212101 in words is "one hundred twenty trillion, one hundred twenty billion, two hundred ten million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •