Base | Representation |
---|---|
bin | 1011001100101101100010… |
… | …1101111110001001010111 |
3 | 1121121010000222202101021202 |
4 | 2303023120231332021113 |
5 | 3103214022110400043 |
6 | 42104304131503115 |
7 | 2410404630554153 |
oct | 263133055761127 |
9 | 47533028671252 |
10 | 12313012200023 |
11 | 3a17a12429617 |
12 | 146a416a57a9b |
13 | 6b415c2a2222 |
14 | 307d4ad44063 |
15 | 165452b411b8 |
hex | b32d8b7e257 |
12313012200023 has 16 divisors (see below), whose sum is σ = 12774921022080. Its totient is φ = 11853598073856.
The previous prime is 12313012200019. The next prime is 12313012200061. The reversal of 12313012200023 is 32000221031321.
It is a cyclic number.
It is not a de Polignac number, because 12313012200023 - 22 = 12313012200019 is a prime.
It is a super-2 number, since 2×123130122000232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12313012199968 and 12313012200004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12313012200523) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 117027986 + ... + 117133152.
It is an arithmetic number, because the mean of its divisors is an integer number (798432563880).
Almost surely, 212313012200023 is an apocalyptic number.
12313012200023 is a deficient number, since it is larger than the sum of its proper divisors (461908822057).
12313012200023 is a wasteful number, since it uses less digits than its factorization.
12313012200023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116986.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12313012200023 its reverse (32000221031321), we get a palindrome (44313233231344).
The spelling of 12313012200023 in words is "twelve trillion, three hundred thirteen billion, twelve million, two hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •