Base | Representation |
---|---|
bin | 10001011110101111000… |
… | …001010011011011011101 |
3 | 11020211120221100212220122 |
4 | 101132233001103123131 |
5 | 124140110422330414 |
6 | 2315501035324325 |
7 | 152533440325442 |
oct | 21365701233335 |
9 | 4224527325818 |
10 | 1201232230109 |
11 | 42349230688a |
12 | 1749822b06a5 |
13 | 89377985252 |
14 | 421d60479c9 |
15 | 213a7e90b8e |
hex | 117af0536dd |
1201232230109 has 2 divisors, whose sum is σ = 1201232230110. Its totient is φ = 1201232230108.
The previous prime is 1201232230103. The next prime is 1201232230169. The reversal of 1201232230109 is 9010322321021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 758428490884 + 442803739225 = 870878^2 + 665435^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1201232230109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1201232230103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600616115054 + 600616115055.
It is an arithmetic number, because the mean of its divisors is an integer number (600616115055).
Almost surely, 21201232230109 is an apocalyptic number.
It is an amenable number.
1201232230109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1201232230109 is an equidigital number, since it uses as much as digits as its factorization.
1201232230109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
It can be divided in two parts, 1201232 and 230109, that added together give a palindrome (1431341).
The spelling of 1201232230109 in words is "one trillion, two hundred one billion, two hundred thirty-two million, two hundred thirty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •