Base | Representation |
---|---|
bin | 1011111011001110011010… |
… | …1011011101111110000111 |
3 | 1201102111122111212222200020 |
4 | 2332303212223131332013 |
5 | 3204312100221421043 |
6 | 43515341554150223 |
7 | 2522214213651450 |
oct | 276634653357607 |
9 | 51374574788606 |
10 | 13112110342023 |
11 | 41a58a6502020 |
12 | 157926b282373 |
13 | 74160b4545c4 |
14 | 3348b55c8127 |
15 | 17b121b8ae83 |
hex | bece6addf87 |
13112110342023 has 32 divisors (see below), whose sum is σ = 22744439857152. Its totient is φ = 6515334328800.
The previous prime is 13112110342003. The next prime is 13112110342033. The reversal of 13112110342023 is 32024301121131.
It is not a de Polignac number, because 13112110342023 - 26 = 13112110341959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13112110341984 and 13112110342002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13112110342003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1233959523 + ... + 1233970148.
It is an arithmetic number, because the mean of its divisors is an integer number (710763745536).
Almost surely, 213112110342023 is an apocalyptic number.
13112110342023 is a deficient number, since it is larger than the sum of its proper divisors (9632329515129).
13112110342023 is a wasteful number, since it uses less digits than its factorization.
13112110342023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2467929715.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13112110342023 its reverse (32024301121131), we get a palindrome (45136411463154).
The spelling of 13112110342023 in words is "thirteen trillion, one hundred twelve billion, one hundred ten million, three hundred forty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •