Base | Representation |
---|---|
bin | 11001010001000011010110… |
… | …111101011100010100101011 |
3 | 112120110020212221202111222010 |
4 | 121101003112331130110223 |
5 | 104031114401040010011 |
6 | 1032201111313531003 |
7 | 32256241352626602 |
oct | 3121032675342453 |
9 | 476406787674863 |
10 | 111123000313131 |
11 | 32452aaa784934 |
12 | 1056846bb73a63 |
13 | 4a00b14218271 |
14 | 1d6254bd78a39 |
15 | cca86e5361a6 |
hex | 6510d6f5c52b |
111123000313131 has 16 divisors (see below), whose sum is σ = 165136347216000. Its totient is φ = 66054538885248.
The previous prime is 111123000313123. The next prime is 111123000313183. The reversal of 111123000313131 is 131313000321111.
It is not a de Polignac number, because 111123000313131 - 23 = 111123000313123 is a prime.
It is a super-2 number, since 2×1111230003131312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111123000313098 and 111123000313107.
It is not an unprimeable number, because it can be changed into a prime (111123000313111) 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, 57339008481 + ... + 57339010418.
It is an arithmetic number, because the mean of its divisors is an integer number (10321021701000).
Almost surely, 2111123000313131 is an apocalyptic number.
111123000313131 is a deficient number, since it is larger than the sum of its proper divisors (54013346902869).
111123000313131 is a wasteful number, since it uses less digits than its factorization.
111123000313131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114678018938.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 111123000313131 its reverse (131313000321111), we get a palindrome (242436000634242).
The spelling of 111123000313131 in words is "one hundred eleven trillion, one hundred twenty-three billion, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •