Base | Representation |
---|---|
bin | 11100100000111101100101… |
… | …100100011000101100000111 |
3 | 121110001010022011201111102222 |
4 | 130200331211210120230013 |
5 | 112414211102223104111 |
6 | 1122420433421322555 |
7 | 35262414651302063 |
oct | 3440754544305407 |
9 | 543033264644388 |
10 | 125410454113031 |
11 | 36a613029a29aa |
12 | 1209547740645b |
13 | 54c9202926569 |
14 | 22d7c8118aaa3 |
15 | e773314307db |
hex | 720f65918b07 |
125410454113031 has 32 divisors (see below), whose sum is σ = 131918991303168. Its totient is φ = 118992858969600.
The previous prime is 125410454113027. The next prime is 125410454113069. The reversal of 125410454113031 is 130311454014521.
It is a cyclic number.
It is not a de Polignac number, because 125410454113031 - 22 = 125410454113027 is a prime.
It is a super-2 number, since 2×1254104541130312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125410454112982 and 125410454113000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125410454118031) 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, 10758375755 + ... + 10758387411.
It is an arithmetic number, because the mean of its divisors is an integer number (4122468478224).
Almost surely, 2125410454113031 is an apocalyptic number.
125410454113031 is a deficient number, since it is larger than the sum of its proper divisors (6508537190137).
125410454113031 is a wasteful number, since it uses less digits than its factorization.
125410454113031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17111.
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 125410454113031 in words is "one hundred twenty-five trillion, four hundred ten billion, four hundred fifty-four million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •