Base | Representation |
---|---|
bin | 1011000110101110111011… |
… | …0001100101011110110111 |
3 | 1121020021221000100000002212 |
4 | 2301223232301211132313 |
5 | 3100023200033444343 |
6 | 41545200305524035 |
7 | 2400110456204303 |
oct | 261535661453667 |
9 | 47207830300085 |
10 | 12210303031223 |
11 | 39883a6814940 |
12 | 145253194361b |
13 | 6a757141892b |
14 | 302da6184d03 |
15 | 162940b5ec18 |
hex | b1aeec657b7 |
12210303031223 has 4 divisors (see below), whose sum is σ = 13320330579528. Its totient is φ = 11100275482920.
The previous prime is 12210303031207. The next prime is 12210303031249. The reversal of 12210303031223 is 32213030301221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12210303031223 - 24 = 12210303031207 is a prime.
It is a super-2 number, since 2×122103030312232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12210303031253) 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, 555013774136 + ... + 555013774157.
It is an arithmetic number, because the mean of its divisors is an integer number (3330082644882).
Almost surely, 212210303031223 is an apocalyptic number.
12210303031223 is a deficient number, since it is larger than the sum of its proper divisors (1110027548305).
12210303031223 is a wasteful number, since it uses less digits than its factorization.
12210303031223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110027548304.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 12210303031223 its reverse (32213030301221), we get a palindrome (44423333332444).
The spelling of 12210303031223 in words is "twelve trillion, two hundred ten billion, three hundred three million, thirty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •