Base | Representation |
---|---|
bin | 11100000010011100100110… |
… | …000101011101001111000011 |
3 | 121011121122120000010010000111 |
4 | 130002130212011131033003 |
5 | 112130331413410001011 |
6 | 1114133225314332151 |
7 | 34655050060035001 |
oct | 3402344605351703 |
9 | 534548500103014 |
10 | 123313445000131 |
11 | 36322a35a22841 |
12 | 119b6b7b28a057 |
13 | 53a653c3c6149 |
14 | 226458c98da71 |
15 | e3c9ebaac121 |
hex | 70272615d3c3 |
123313445000131 has 2 divisors, whose sum is σ = 123313445000132. Its totient is φ = 123313445000130.
The previous prime is 123313445000063. The next prime is 123313445000149. The reversal of 123313445000131 is 131000544313321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123313445000131 - 229 = 123312908129219 is a prime.
It is a super-2 number, since 2×1233134450001312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123313445000093 and 123313445000102.
It is not a weakly prime, because it can be changed into another prime (123313445000731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61656722500065 + 61656722500066.
It is an arithmetic number, because the mean of its divisors is an integer number (61656722500066).
Almost surely, 2123313445000131 is an apocalyptic number.
123313445000131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123313445000131 is an equidigital number, since it uses as much as digits as its factorization.
123313445000131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 123313445000131 its reverse (131000544313321), we get a palindrome (254313989313452).
The spelling of 123313445000131 in words is "one hundred twenty-three trillion, three hundred thirteen billion, four hundred forty-five million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •