Base | Representation |
---|---|
bin | 1011001101110001010110… |
… | …0100100101110001000111 |
3 | 1121122212000102210211211220 |
4 | 2303130111210211301013 |
5 | 3104013311013121411 |
6 | 42120514150331423 |
7 | 2411620645151010 |
oct | 263342544456107 |
9 | 47585012724756 |
10 | 12331213020231 |
11 | 3a24702304196 |
12 | 1471a56359b73 |
13 | 6b5a9ccb6221 |
14 | 308b962c8007 |
15 | 165b6a966b06 |
hex | b3715925c47 |
12331213020231 has 32 divisors (see below), whose sum is σ = 19336706408448. Its totient is φ = 6843838890720.
The previous prime is 12331213020211. The next prime is 12331213020253. The reversal of 12331213020231 is 13202031213321.
12331213020231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12331213020231 - 25 = 12331213020199 is a prime.
It is a super-2 number, since 2×123312130202312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12331213020211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 47556315 + ... + 47814908.
It is an arithmetic number, because the mean of its divisors is an integer number (604272075264).
Almost surely, 212331213020231 is an apocalyptic number.
12331213020231 is a deficient number, since it is larger than the sum of its proper divisors (7005493388217).
12331213020231 is a wasteful number, since it uses less digits than its factorization.
12331213020231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95371411.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 12331213020231 its reverse (13202031213321), we get a palindrome (25533244233552).
The spelling of 12331213020231 in words is "twelve trillion, three hundred thirty-one billion, two hundred thirteen million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •