Base | Representation |
---|---|
bin | 111010010011101010… |
… | …1100001011110000011 |
3 | 102222012101020111220022 |
4 | 1310213111201132003 |
5 | 4022414241130443 |
6 | 133304510404055 |
7 | 12021630324344 |
oct | 1644725413603 |
9 | 388171214808 |
10 | 125214005123 |
11 | 49115050369 |
12 | 20325b0062b |
13 | ba66494abc |
14 | 60bb9d40cb |
15 | 33ccad0e68 |
hex | 1d27561783 |
125214005123 has 8 divisors (see below), whose sum is σ = 125394455760. Its totient is φ = 125033610240.
The previous prime is 125214005089. The next prime is 125214005233. The reversal of 125214005123 is 321500412521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125214005123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125214005092 and 125214005101.
It is not an unprimeable number, because it can be changed into a prime (125214007123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6766043 + ... + 6784523.
It is an arithmetic number, because the mean of its divisors is an integer number (15674306970).
Almost surely, 2125214005123 is an apocalyptic number.
125214005123 is a deficient number, since it is larger than the sum of its proper divisors (180450637).
125214005123 is an equidigital number, since it uses as much as digits as its factorization.
125214005123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27877.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 125214005123 its reverse (321500412521), we get a palindrome (446714417644).
The spelling of 125214005123 in words is "one hundred twenty-five billion, two hundred fourteen million, five thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •