Base | Representation |
---|---|
bin | 11011111110000011000010… |
… | …101101101001001000111011 |
3 | 121010112202020011022002110211 |
4 | 123332003002231221020323 |
5 | 112110403243301233311 |
6 | 1113342311045051551 |
7 | 34624155322562212 |
oct | 3376030255511073 |
9 | 533482204262424 |
10 | 123011130102331 |
11 | 3621680005a569 |
12 | 1196846a6b6bb7 |
13 | 5383b90b07433 |
14 | 2253ab0222079 |
15 | e34c06087821 |
hex | 6fe0c2b6923b |
123011130102331 has 4 divisors (see below), whose sum is σ = 123011155756432. Its totient is φ = 123011104448232.
The previous prime is 123011130102307. The next prime is 123011130102383. The reversal of 123011130102331 is 133201031110321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123011130102331 - 233 = 123002540167739 is a prime.
It is a super-2 number, since 2×1230111301023312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123011130102631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3252120 + ... + 16018693.
It is an arithmetic number, because the mean of its divisors is an integer number (30752788939108).
Almost surely, 2123011130102331 is an apocalyptic number.
123011130102331 is a deficient number, since it is larger than the sum of its proper divisors (25654101).
123011130102331 is an equidigital number, since it uses as much as digits as its factorization.
123011130102331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25654100.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 123011130102331 its reverse (133201031110321), we get a palindrome (256212161212652).
The spelling of 123011130102331 in words is "one hundred twenty-three trillion, eleven billion, one hundred thirty million, one hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •