Base | Representation |
---|---|
bin | 11011111110000101000000… |
… | …011111001110011110111111 |
3 | 121010112221200012220211010021 |
4 | 123332011000133032132333 |
5 | 112110422104001033401 |
6 | 1113343300304553011 |
7 | 34624261524552121 |
oct | 3376050037163677 |
9 | 533487605824107 |
10 | 123013240252351 |
11 | 362176931a04a9 |
12 | 11968959322767 |
13 | 538413903a207 |
14 | 2253c30591211 |
15 | e34ccb4572a1 |
hex | 6fe1407ce7bf |
123013240252351 has 2 divisors, whose sum is σ = 123013240252352. Its totient is φ = 123013240252350.
The previous prime is 123013240252327. The next prime is 123013240252361. The reversal of 123013240252351 is 153252042310321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123013240252351 - 213 = 123013240244159 is a prime.
It is a super-2 number, since 2×1230132402523512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123013240252361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61506620126175 + 61506620126176.
It is an arithmetic number, because the mean of its divisors is an integer number (61506620126176).
Almost surely, 2123013240252351 is an apocalyptic number.
123013240252351 is a deficient number, since it is larger than the sum of its proper divisors (1).
123013240252351 is an equidigital number, since it uses as much as digits as its factorization.
123013240252351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 123013240252351 its reverse (153252042310321), we get a palindrome (276265282562672).
The spelling of 123013240252351 in words is "one hundred twenty-three trillion, thirteen billion, two hundred forty million, two hundred fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •