Base | Representation |
---|---|
bin | 1011000111011110100110… |
… | …1010001010101011011000 |
3 | 1121021111222000001011210212 |
4 | 2301313221222022223120 |
5 | 3100230403114232412 |
6 | 41555114322230252 |
7 | 2401042602415160 |
oct | 261675152125330 |
9 | 47244860034725 |
10 | 12223102102232 |
11 | 399287453237a |
12 | 1454b041b5388 |
13 | 6a8830c99528 |
14 | 30385bd695a0 |
15 | 162e3e622222 |
hex | b1de9a8aad8 |
12223102102232 has 32 divisors (see below), whose sum is σ = 26801486342400. Its totient is φ = 5116647390624.
The previous prime is 12223102102229. The next prime is 12223102102241. The reversal of 12223102102232 is 23220120132221.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 12223102102198 and 12223102102207.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 2538017132 + ... + 2538021947.
It is an arithmetic number, because the mean of its divisors is an integer number (837546448200).
Almost surely, 212223102102232 is an apocalyptic number.
It is an amenable number.
12223102102232 is an abundant number, since it is smaller than the sum of its proper divisors (14578384240168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12223102102232 is a wasteful number, since it uses less digits than its factorization.
12223102102232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5076039135 (or 5076039131 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 12223102102232 its reverse (23220120132221), we get a palindrome (35443222234453).
The spelling of 12223102102232 in words is "twelve trillion, two hundred twenty-three billion, one hundred two million, one hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •