Base | Representation |
---|---|
bin | 1011000110101110111010… |
… | …1001111101011100011111 |
3 | 1121020021220212120102222211 |
4 | 2301223232221331130133 |
5 | 3100023144031012343 |
6 | 41545200155021251 |
7 | 2400110433210310 |
oct | 261535651753437 |
9 | 47207825512884 |
10 | 12210301032223 |
11 | 39883a5679a78 |
12 | 145253113a827 |
13 | 6a7570b98aa8 |
14 | 302da5bc4607 |
15 | 1629408b779d |
hex | b1aeea7d71f |
12210301032223 has 8 divisors (see below), whose sum is σ = 13956068895392. Its totient is φ = 10464892955136.
The previous prime is 12210301032103. The next prime is 12210301032247. The reversal of 12210301032223 is 32223010301221.
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 12210301032223 - 221 = 12210298935071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12210301032194 and 12210301032203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210301032253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89873790 + ... + 90009547.
It is an arithmetic number, because the mean of its divisors is an integer number (1744508611924).
Almost surely, 212210301032223 is an apocalyptic number.
12210301032223 is a deficient number, since it is larger than the sum of its proper divisors (1745767863169).
12210301032223 is an equidigital number, since it uses as much as digits as its factorization.
12210301032223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179893041.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12210301032223 its reverse (32223010301221), we get a palindrome (44433311333444).
The spelling of 12210301032223 in words is "twelve trillion, two hundred ten billion, three hundred one million, thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •