Base | Representation |
---|---|
bin | 111010010111100001… |
… | …1100100000110000011 |
3 | 102222112101221022001211 |
4 | 1310233003210012003 |
5 | 4023200414440021 |
6 | 133325414310551 |
7 | 12025062204241 |
oct | 1645703440603 |
9 | 388471838054 |
10 | 125343515011 |
11 | 49181168030 |
12 | 20361358457 |
13 | ba8726b480 |
14 | 60d0ca7791 |
15 | 33d91643e1 |
hex | 1d2f0e4183 |
125343515011 has 16 divisors (see below), whose sum is σ = 147780809568. Its totient is φ = 104809017600.
The previous prime is 125343514999. The next prime is 125343515021. The reversal of 125343515011 is 110515343521.
It is a cyclic number.
It is not a de Polignac number, because 125343515011 - 223 = 125335126403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (125343515021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1519476 + ... + 1599841.
It is an arithmetic number, because the mean of its divisors is an integer number (9236300598).
Almost surely, 2125343515011 is an apocalyptic number.
125343515011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
125343515011 is a deficient number, since it is larger than the sum of its proper divisors (22437294557).
125343515011 is a wasteful number, since it uses less digits than its factorization.
125343515011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3119622.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 125343515011 its reverse (110515343521), we get a palindrome (235858858532).
The spelling of 125343515011 in words is "one hundred twenty-five billion, three hundred forty-three million, five hundred fifteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •