Base | Representation |
---|---|
bin | 1011000110010100100000… |
… | …1100001001110000110001 |
3 | 1121012121121220121221120221 |
4 | 2301211020030021300301 |
5 | 3044414140041430301 |
6 | 41542025002533041 |
7 | 2366440000003234 |
oct | 261451014116061 |
9 | 47177556557527 |
10 | 12203213233201 |
11 | 3985398807731 |
12 | 1451093507181 |
13 | 6a69b1631983 |
14 | 3028d273141b |
15 | 162678508da1 |
hex | b1948309c31 |
12203213233201 has 2 divisors, whose sum is σ = 12203213233202. Its totient is φ = 12203213233200.
The previous prime is 12203213233157. The next prime is 12203213233313. The reversal of 12203213233201 is 10233231230221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11268509059600 + 934704173601 = 3356860^2 + 966801^2 .
It is a cyclic number.
It is not a de Polignac number, because 12203213233201 - 29 = 12203213232689 is a prime.
It is not a weakly prime, because it can be changed into another prime (12203213233801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101606616600 + 6101606616601.
It is an arithmetic number, because the mean of its divisors is an integer number (6101606616601).
Almost surely, 212203213233201 is an apocalyptic number.
It is an amenable number.
12203213233201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203213233201 is an equidigital number, since it uses as much as digits as its factorization.
12203213233201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12203213233201 its reverse (10233231230221), we get a palindrome (22436444463422).
The spelling of 12203213233201 in words is "twelve trillion, two hundred three billion, two hundred thirteen million, two hundred thirty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •