Base | Representation |
---|---|
bin | 111001011010111101… |
… | …0001011110101101111 |
3 | 102210021202102111210010 |
4 | 1302311322023311233 |
5 | 4010020104410411 |
6 | 132352010544303 |
7 | 11623522214130 |
oct | 1626572136557 |
9 | 383252374703 |
10 | 123311013231 |
11 | 4832894139a |
12 | 1ba94738093 |
13 | b8221544b3 |
14 | 5d7ad8bc87 |
15 | 331a9d17a6 |
hex | 1cb5e8bd6f |
123311013231 has 16 divisors (see below), whose sum is σ = 188876090624. Its totient is φ = 70098338304.
The previous prime is 123311013211. The next prime is 123311013247. The reversal of 123311013231 is 132310113321.
It is a happy number.
It is not a de Polignac number, because 123311013231 - 217 = 123310882159 is a prime.
It is a super-2 number, since 2×1233110132312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123311013198 and 123311013207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123311013211) 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, 15208261 + ... + 15216366.
It is an arithmetic number, because the mean of its divisors is an integer number (11804755664).
Almost surely, 2123311013231 is an apocalyptic number.
123311013231 is a deficient number, since it is larger than the sum of its proper divisors (65565077393).
123311013231 is a wasteful number, since it uses less digits than its factorization.
123311013231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30424830.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 123311013231 its reverse (132310113321), we get a palindrome (255621126552).
The spelling of 123311013231 in words is "one hundred twenty-three billion, three hundred eleven million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •