Base | Representation |
---|---|
bin | 1011001000000000100111… |
… | …0010001010000001101111 |
3 | 1121022101112012200100100221 |
4 | 2302000021302022001233 |
5 | 3100403102114032343 |
6 | 42003224230232211 |
7 | 2401515041656021 |
oct | 262001162120157 |
9 | 47271465610327 |
10 | 12232231002223 |
11 | 3996729564021 |
12 | 14568314b5667 |
13 | 6a965736b6bb |
14 | 304086536011 |
15 | 1632c5cb15ed |
hex | b2009c8a06f |
12232231002223 has 8 divisors (see below), whose sum is σ = 12279629022080. Its totient is φ = 12184912577880.
The previous prime is 12232231002217. The next prime is 12232231002349. The reversal of 12232231002223 is 32220013223221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12232231002223 - 237 = 12094792048751 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12232231006223) 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 in 7 ways as a sum of consecutive naturals, for example, 19590915 + ... + 20205652.
It is an arithmetic number, because the mean of its divisors is an integer number (1534953627760).
Almost surely, 212232231002223 is an apocalyptic number.
12232231002223 is a deficient number, since it is larger than the sum of its proper divisors (47398019857).
12232231002223 is an equidigital number, since it uses as much as digits as its factorization.
12232231002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39797757.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 12232231002223 its reverse (32220013223221), we get a palindrome (44452244225444).
The spelling of 12232231002223 in words is "twelve trillion, two hundred thirty-two billion, two hundred thirty-one million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •