Base | Representation |
---|---|
bin | 1011001101001000011100… |
… | …0000010110001100111111 |
3 | 1121121210200002121121001011 |
4 | 2303102013000112030333 |
5 | 3103323313143020111 |
6 | 42111500332300051 |
7 | 2411051546325550 |
oct | 263220700261477 |
9 | 47553602547034 |
10 | 12320231220031 |
11 | 3a1aa87377159 |
12 | 146b8b0611627 |
13 | 6b4a3ca917b7 |
14 | 3084339d4327 |
15 | 1657267c0021 |
hex | b348701633f |
12320231220031 has 32 divisors (see below), whose sum is σ = 15158015566848. Its totient is φ = 9791061960960.
The previous prime is 12320231219999. The next prime is 12320231220053. The reversal of 12320231220031 is 13002213202321.
It is not a de Polignac number, because 12320231220031 - 25 = 12320231219999 is a prime.
It is a super-2 number, since 2×123202312200312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12320231219984 and 12320231220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12320231220091) 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, 13034155 + ... + 13947388.
It is an arithmetic number, because the mean of its divisors is an integer number (473687986464).
Almost surely, 212320231220031 is an apocalyptic number.
12320231220031 is a deficient number, since it is larger than the sum of its proper divisors (2837784346817).
12320231220031 is a wasteful number, since it uses less digits than its factorization.
12320231220031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26981671.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12320231220031 its reverse (13002213202321), we get a palindrome (25322444422352).
The spelling of 12320231220031 in words is "twelve trillion, three hundred twenty billion, two hundred thirty-one million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •