Base | Representation |
---|---|
bin | 1011001100100110001000… |
… | …1010001101000000001011 |
3 | 1121120220220100221020202111 |
4 | 2303021202022031000023 |
5 | 3103200433404042303 |
6 | 42103334514443151 |
7 | 2410304425601254 |
oct | 263114212150013 |
9 | 47526810836674 |
10 | 12311023112203 |
11 | 3a17091665492 |
12 | 1469b608934b7 |
13 | 6b3c0317899a |
14 | 307bdcac9b2b |
15 | 1653881d6b6d |
hex | b326228d00b |
12311023112203 has 16 divisors (see below), whose sum is σ = 12839779321600. Its totient is φ = 11790749888640.
The previous prime is 12311023112119. The next prime is 12311023112221. The reversal of 12311023112203 is 30221132011321.
It is a cyclic number.
It is not a de Polignac number, because 12311023112203 - 213 = 12311023104011 is a prime.
It is a super-2 number, since 2×123110231122032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12311023112273) 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 15 ways as a sum of consecutive naturals, for example, 746653 + ... + 5017921.
It is an arithmetic number, because the mean of its divisors is an integer number (802486207600).
Almost surely, 212311023112203 is an apocalyptic number.
12311023112203 is a deficient number, since it is larger than the sum of its proper divisors (528756209397).
12311023112203 is a wasteful number, since it uses less digits than its factorization.
12311023112203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4272262.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12311023112203 its reverse (30221132011321), we get a palindrome (42532155123524).
The spelling of 12311023112203 in words is "twelve trillion, three hundred eleven billion, twenty-three million, one hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •