Base | Representation |
---|---|
bin | 111010011100000001… |
… | …0110010011110111111 |
3 | 102222220220200022110002 |
4 | 1310320002302132333 |
5 | 4024003020304001 |
6 | 133352402304515 |
7 | 12031603002302 |
oct | 1647002623677 |
9 | 388826608402 |
10 | 125494306751 |
11 | 492492a0100 |
12 | 203a395813b |
13 | baac586858 |
14 | 6106d1ab39 |
15 | 33e74ed46b |
hex | 1d380b27bf |
125494306751 has 24 divisors (see below), whose sum is σ = 141019419072. Its totient is φ = 111543854400.
The previous prime is 125494306739. The next prime is 125494306753. The reversal of 125494306751 is 157603494521.
It is a happy number.
It is not a de Polignac number, because 125494306751 - 226 = 125427197887 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125494306696 and 125494306705.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125494306753) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5795621 + ... + 5817233.
It is an arithmetic number, because the mean of its divisors is an integer number (5875809128).
Almost surely, 2125494306751 is an apocalyptic number.
125494306751 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
125494306751 is a deficient number, since it is larger than the sum of its proper divisors (15525112321).
125494306751 is a wasteful number, since it uses less digits than its factorization.
125494306751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22703 (or 22692 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 47.
The spelling of 125494306751 in words is "one hundred twenty-five billion, four hundred ninety-four million, three hundred six thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •