Base | Representation |
---|---|
bin | 1011000010001011101000… |
… | …0111100111000101111001 |
3 | 1120221211002121201200021121 |
4 | 2300202322013213011321 |
5 | 3042233030202414314 |
6 | 41445225310105241 |
7 | 2361342000131665 |
oct | 260427207470571 |
9 | 46854077650247 |
10 | 12132110201209 |
11 | 3958220a1a379 |
12 | 143b34b1ab221 |
13 | 6a008c81458b |
14 | 2dd2a942b8a5 |
15 | 1608b6163d24 |
hex | b08ba1e7179 |
12132110201209 has 2 divisors, whose sum is σ = 12132110201210. Its totient is φ = 12132110201208.
The previous prime is 12132110201203. The next prime is 12132110201227. The reversal of 12132110201209 is 90210201123121.
12132110201209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6785748872809 + 5346361328400 = 2604947^2 + 2312220^2 .
It is a cyclic number.
It is not a de Polignac number, because 12132110201209 - 213 = 12132110193017 is a prime.
It is a super-3 number, since 3×121321102012093 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (12132110201203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6066055100604 + 6066055100605.
It is an arithmetic number, because the mean of its divisors is an integer number (6066055100605).
Almost surely, 212132110201209 is an apocalyptic number.
It is an amenable number.
12132110201209 is a deficient number, since it is larger than the sum of its proper divisors (1).
12132110201209 is an equidigital number, since it uses as much as digits as its factorization.
12132110201209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 12132110201209 in words is "twelve trillion, one hundred thirty-two billion, one hundred ten million, two hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •