Base | Representation |
---|---|
bin | 11011111110010101111100… |
… | …111011101000110010001011 |
3 | 121010121200122012001020101120 |
4 | 123332111330323220302023 |
5 | 112111221334123433001 |
6 | 1113355505520250323 |
7 | 34625504426562621 |
oct | 3376257473506213 |
9 | 533550565036346 |
10 | 123031434202251 |
11 | 3622437a203333 |
12 | 119703964709a3 |
13 | 5385a784b7043 |
14 | 2254a78a67511 |
15 | e354e3872236 |
hex | 6fe57cee8c8b |
123031434202251 has 8 divisors (see below), whose sum is σ = 164099249545104. Its totient is φ = 81992287497120.
The previous prime is 123031434202249. The next prime is 123031434202289. The reversal of 123031434202251 is 152202434130321.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123031434202251 - 21 = 123031434202249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (123031434202231) 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 in 7 ways as a sum of consecutive naturals, for example, 7167149416 + ... + 7167166581.
It is an arithmetic number, because the mean of its divisors is an integer number (20512406193138).
Almost surely, 2123031434202251 is an apocalyptic number.
123031434202251 is a deficient number, since it is larger than the sum of its proper divisors (41067815342853).
123031434202251 is a wasteful number, since it uses less digits than its factorization.
123031434202251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14334318861.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 123031434202251 its reverse (152202434130321), we get a palindrome (275233868332572).
The spelling of 123031434202251 in words is "one hundred twenty-three trillion, thirty-one billion, four hundred thirty-four million, two hundred two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.214 sec. • engine limits •