Base | Representation |
---|---|
bin | 11100011111100010111110… |
… | …011100111000011101000101 |
3 | 121102200211011122200211121210 |
4 | 130133202332130320131011 |
5 | 112411112323213223110 |
6 | 1122304023234002033 |
7 | 35252401644134430 |
oct | 3437427634703505 |
9 | 542624148624553 |
10 | 125313161070405 |
11 | 36a24016575a60 |
12 | 1207a644116319 |
13 | 54bcc98b98259 |
14 | 22d3291850817 |
15 | e74a39ba2520 |
hex | 71f8be738745 |
125313161070405 has 64 divisors (see below), whose sum is σ = 253139589734400. Its totient is φ = 51418979089920.
The previous prime is 125313161070389. The next prime is 125313161070469. The reversal of 125313161070405 is 504070161313521.
It is not a de Polignac number, because 125313161070405 - 24 = 125313161070389 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 686593840 + ... + 686776329.
It is an arithmetic number, because the mean of its divisors is an integer number (3955306089600).
Almost surely, 2125313161070405 is an apocalyptic number.
125313161070405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
125313161070405 is an abundant number, since it is smaller than the sum of its proper divisors (127826428663995).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125313161070405 is a wasteful number, since it uses less digits than its factorization.
125313161070405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1373370274.
The product of its (nonzero) digits is 75600, while the sum is 39.
The spelling of 125313161070405 in words is "one hundred twenty-five trillion, three hundred thirteen billion, one hundred sixty-one million, seventy thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •