Base | Representation |
---|---|
bin | 1011000001100110010101… |
… | …1110100010011000110101 |
3 | 1120220212021000011121022201 |
4 | 2300121211132202120311 |
5 | 3042102030123311201 |
6 | 41440452125224501 |
7 | 2360535641500531 |
oct | 260314536423065 |
9 | 46825230147281 |
10 | 12122100213301 |
11 | 3953a546032a1 |
12 | 1439416a02131 |
13 | 69c155a3ac00 |
14 | 2dc9d9c28bc1 |
15 | 1604cc481801 |
hex | b06657a2635 |
12122100213301 has 6 divisors (see below), whose sum is σ = 13126297864290. Its totient is φ = 11189630965968.
The previous prime is 12122100213187. The next prime is 12122100213313. The reversal of 12122100213301 is 10331200122121.
It can be written as a sum of positive squares in 3 ways, for example, as 3165750225 + 12118934463076 = 56265^2 + 3481226^2 .
It is a de Polignac number, because none of the positive numbers 2k-12122100213301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122100213331) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 35864201646 + ... + 35864201983.
It is an arithmetic number, because the mean of its divisors is an integer number (2187716310715).
Almost surely, 212122100213301 is an apocalyptic number.
It is an amenable number.
12122100213301 is a deficient number, since it is larger than the sum of its proper divisors (1004197650989).
12122100213301 is an equidigital number, since it uses as much as digits as its factorization.
12122100213301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71728403655 (or 71728403642 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12122100213301 its reverse (10331200122121), we get a palindrome (22453300335422).
The spelling of 12122100213301 in words is "twelve trillion, one hundred twenty-two billion, one hundred million, two hundred thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •