Base | Representation |
---|---|
bin | 111010010100001011… |
… | …0011100011110110111 |
3 | 102222020120021011111010 |
4 | 1310220112130132313 |
5 | 4022433120232210 |
6 | 133310315243303 |
7 | 12022225066254 |
oct | 1645026343667 |
9 | 388216234433 |
10 | 125231024055 |
11 | 491237149a5 |
12 | 2032b749533 |
13 | ba69b73387 |
14 | 60bdd8442b |
15 | 33ce343920 |
hex | 1d2859c7b7 |
125231024055 has 32 divisors (see below), whose sum is σ = 202478814720. Its totient is φ = 66087872640.
The previous prime is 125231024053. The next prime is 125231024057. The reversal of 125231024055 is 550420132521.
It is an interprime number because it is at equal distance from previous prime (125231024053) and next prime (125231024057).
It is not a de Polignac number, because 125231024055 - 21 = 125231024053 is a prime.
It is a super-3 number, since 3×1252310240553 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125231024053) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1912965 + ... + 1977345.
It is an arithmetic number, because the mean of its divisors is an integer number (6327462960).
Almost surely, 2125231024055 is an apocalyptic number.
125231024055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
125231024055 is a deficient number, since it is larger than the sum of its proper divisors (77247790665).
125231024055 is a wasteful number, since it uses less digits than its factorization.
125231024055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65751.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 125231024055 its reverse (550420132521), we get a palindrome (675651156576).
The spelling of 125231024055 in words is "one hundred twenty-five billion, two hundred thirty-one million, twenty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •