Base | Representation |
---|---|
bin | 1011000001011111010001… |
… | …0110001100100000001101 |
3 | 1120220200100201201121001120 |
4 | 2300113310112030200031 |
5 | 3042034133230413401 |
6 | 41435535524231153 |
7 | 2360440623610341 |
oct | 260276426144015 |
9 | 46820321647046 |
10 | 12120202201101 |
11 | 3953170195675 |
12 | 1438b8723b4b9 |
13 | 69bc12752077 |
14 | 2dc899b1b621 |
15 | 16041aa17836 |
hex | b05f458c80d |
12120202201101 has 32 divisors (see below), whose sum is σ = 17204920992000. Its totient is φ = 7563069803520.
The previous prime is 12120202201097. The next prime is 12120202201111. The reversal of 12120202201101 is 10110220202121.
It is not a de Polignac number, because 12120202201101 - 22 = 12120202201097 is a prime.
It is a super-2 number, since 2×121202022011012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120202201111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21450115 + ... + 22007903.
It is an arithmetic number, because the mean of its divisors is an integer number (537653781000).
Almost surely, 212120202201101 is an apocalyptic number.
It is an amenable number.
12120202201101 is a deficient number, since it is larger than the sum of its proper divisors (5084718790899).
12120202201101 is a wasteful number, since it uses less digits than its factorization.
12120202201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560149.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12120202201101 its reverse (10110220202121), we get a palindrome (22230422403222).
The spelling of 12120202201101 in words is "twelve trillion, one hundred twenty billion, two hundred two million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •