Base | Representation |
---|---|
bin | 11100000010011100010010… |
… | …000111100010010111101011 |
3 | 121011121121200122202101210010 |
4 | 130002130102013202113223 |
5 | 112130330222130014011 |
6 | 1114133132150223003 |
7 | 34655035551426351 |
oct | 3402342207422753 |
9 | 534547618671703 |
10 | 123313110001131 |
11 | 36322883914066 |
12 | 119b6aa7054a63 |
13 | 53a64b7b92b9b |
14 | 226455a2a97d1 |
15 | e3c9cc4881a6 |
hex | 7027121e25eb |
123313110001131 has 32 divisors (see below), whose sum is σ = 173568752566272. Its totient is φ = 77772626426880.
The previous prime is 123313110001129. The next prime is 123313110001163. The reversal of 123313110001131 is 131100011313321.
It is not a de Polignac number, because 123313110001131 - 21 = 123313110001129 is a prime.
It is a super-2 number, since 2×1233131100011312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123313110001098 and 123313110001107.
It is not an unprimeable number, because it can be changed into a prime (123313110001171) 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, 79603035 + ... + 81137348.
It is an arithmetic number, because the mean of its divisors is an integer number (5424023517696).
Almost surely, 2123313110001131 is an apocalyptic number.
123313110001131 is a deficient number, since it is larger than the sum of its proper divisors (50255642565141).
123313110001131 is a wasteful number, since it uses less digits than its factorization.
123313110001131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160740603.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 123313110001131 its reverse (131100011313321), we get a palindrome (254413121314452).
The spelling of 123313110001131 in words is "one hundred twenty-three trillion, three hundred thirteen billion, one hundred ten million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •