Base | Representation |
---|---|
bin | 1011000001011110100101… |
… | …1111111010101010100101 |
3 | 1120220122220001020222121210 |
4 | 2300113221133322222211 |
5 | 3042033300132400401 |
6 | 41435505503302033 |
7 | 2360433253616232 |
oct | 260275137725245 |
9 | 46818801228553 |
10 | 12120020200101 |
11 | 3953087486620 |
12 | 1438b362aa919 |
13 | 69bbb3b2a478 |
14 | 2dc87d8a2789 |
15 | 160409a664d6 |
hex | b05e97faaa5 |
12120020200101 has 64 divisors (see below), whose sum is σ = 18187546429440. Its totient is φ = 7116651360000.
The previous prime is 12120020200091. The next prime is 12120020200153. The reversal of 12120020200101 is 10100202002121.
It is not a de Polignac number, because 12120020200101 - 26 = 12120020200037 is a prime.
It is a super-5 number, since 5×121200202001015 (a number of 67 digits) contains 55555 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120020200181) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 66859456 + ... + 67040486.
It is an arithmetic number, because the mean of its divisors is an integer number (284180412960).
Almost surely, 212120020200101 is an apocalyptic number.
12120020200101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12120020200101 is a deficient number, since it is larger than the sum of its proper divisors (6067526229339).
12120020200101 is a wasteful number, since it uses less digits than its factorization.
12120020200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181578.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12120020200101 its reverse (10100202002121), we get a palindrome (22220222202222).
The spelling of 12120020200101 in words is "twelve trillion, one hundred twenty billion, twenty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •