Base | Representation |
---|---|
bin | 1011000111011110111110… |
… | …0000110001101011010101 |
3 | 1121021112012211211100002001 |
4 | 2301313233200301223111 |
5 | 3100231103234210304 |
6 | 41555132151115301 |
7 | 2401045204210204 |
oct | 261675740615325 |
9 | 47245184740061 |
10 | 12223200303829 |
11 | 3992914a05719 |
12 | 1454b31072b31 |
13 | 6a8848430598 |
14 | 30386b00d23b |
15 | 162e4806dda4 |
hex | b1def831ad5 |
12223200303829 has 2 divisors, whose sum is σ = 12223200303830. Its totient is φ = 12223200303828.
The previous prime is 12223200303827. The next prime is 12223200303883. The reversal of 12223200303829 is 92830300232221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11530085777604 + 693114526225 = 3395598^2 + 832535^2 .
It is a cyclic number.
It is not a de Polignac number, because 12223200303829 - 21 = 12223200303827 is a prime.
It is a super-2 number, since 2×122232003038292 (a number of 27 digits) contains 22 as substring.
Together with 12223200303827, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12223200303827) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111600151914 + 6111600151915.
It is an arithmetic number, because the mean of its divisors is an integer number (6111600151915).
Almost surely, 212223200303829 is an apocalyptic number.
It is an amenable number.
12223200303829 is a deficient number, since it is larger than the sum of its proper divisors (1).
12223200303829 is an equidigital number, since it uses as much as digits as its factorization.
12223200303829 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 12223200303829 in words is "twelve trillion, two hundred twenty-three billion, two hundred million, three hundred three thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •