Base | Representation |
---|---|
bin | 111010010001001111… |
… | …0101000010101101001 |
3 | 102221222200212221202210 |
4 | 1310202132220111221 |
5 | 4022232410201343 |
6 | 133252435515333 |
7 | 12016620520062 |
oct | 1644236502551 |
9 | 387880787683 |
10 | 125132506473 |
11 | 49083046207 |
12 | 20302758b49 |
13 | ba5262b550 |
14 | 60b0c5b569 |
15 | 33c5883333 |
hex | 1d227a8569 |
125132506473 has 16 divisors (see below), whose sum is σ = 184059824256. Its totient is φ = 75126456960.
The previous prime is 125132506469. The next prime is 125132506481. The reversal of 125132506473 is 374605231521.
It is not a de Polignac number, because 125132506473 - 22 = 125132506469 is a prime.
It is a super-3 number, since 3×1251325064733 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (125132506403) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39126765 + ... + 39129962.
It is an arithmetic number, because the mean of its divisors is an integer number (11503739016).
Almost surely, 2125132506473 is an apocalyptic number.
125132506473 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
125132506473 is a deficient number, since it is larger than the sum of its proper divisors (58927317783).
125132506473 is a wasteful number, since it uses less digits than its factorization.
125132506473 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78256784.
The product of its (nonzero) digits is 151200, while the sum is 39.
Adding to 125132506473 its reverse (374605231521), we get a palindrome (499737737994).
The spelling of 125132506473 in words is "one hundred twenty-five billion, one hundred thirty-two million, five hundred six thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •