Base | Representation |
---|---|
bin | 11100100000110100101100… |
… | …011100110001010111001011 |
3 | 121110000012122202001001111220 |
4 | 130200310230130301113023 |
5 | 112414032023401143120 |
6 | 1122412214133453123 |
7 | 35261626230542031 |
oct | 3440645434612713 |
9 | 543005582031456 |
10 | 125400905881035 |
11 | 36a582531a1984 |
12 | 120936517a11a3 |
13 | 54c8340704745 |
14 | 22d7617026551 |
15 | e76e7305eb40 |
hex | 720d2c7315cb |
125400905881035 has 32 divisors (see below), whose sum is σ = 214547292482112. Its totient is φ = 62323105996800.
The previous prime is 125400905880919. The next prime is 125400905881049. The reversal of 125400905881035 is 530188509004521.
It is not a de Polignac number, because 125400905881035 - 216 = 125400905815499 is a prime.
It is a super-3 number, since 3×1254009058810353 (a number of 43 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2434470574 + ... + 2434522083.
It is an arithmetic number, because the mean of its divisors is an integer number (6704602890066).
Almost surely, 2125400905881035 is an apocalyptic number.
125400905881035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
125400905881035 is a deficient number, since it is larger than the sum of its proper divisors (89146386601077).
125400905881035 is a wasteful number, since it uses less digits than its factorization.
125400905881035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4868992783.
The product of its (nonzero) digits is 1728000, while the sum is 51.
The spelling of 125400905881035 in words is "one hundred twenty-five trillion, four hundred billion, nine hundred five million, eight hundred eighty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •