Base | Representation |
---|---|
bin | 1011001000000100001110… |
… | …0110110010110111110010 |
3 | 1121022111000211002112112020 |
4 | 2302001003212302313302 |
5 | 3100412043440233242 |
6 | 42003504403012310 |
7 | 2401551061456134 |
oct | 262010346626762 |
9 | 47274024075466 |
10 | 12233201102322 |
11 | 3997087115642 |
12 | 1456a6236a096 |
13 | 6a978033a325 |
14 | 3041392dd054 |
15 | 1633310386ec |
hex | b20439b2df2 |
12233201102322 has 8 divisors (see below), whose sum is σ = 24466402204656. Its totient is φ = 4077733700772.
The previous prime is 12233201102279. The next prime is 12233201102327. The reversal of 12233201102322 is 22320110233221.
It is a sphenic number, since it is the product of 3 distinct primes.
12233201102322 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 12233201102292 and 12233201102301.
It is not an unprimeable number, because it can be changed into a prime (12233201102327) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1019433425188 + ... + 1019433425199.
It is an arithmetic number, because the mean of its divisors is an integer number (3058300275582).
Almost surely, 212233201102322 is an apocalyptic number.
12233201102322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12233201102322 is a wasteful number, since it uses less digits than its factorization.
12233201102322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2038866850392.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 12233201102322 its reverse (22320110233221), we get a palindrome (34553311335543).
The spelling of 12233201102322 in words is "twelve trillion, two hundred thirty-three billion, two hundred one million, one hundred two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •