Base | Representation |
---|---|
bin | 111010011010000011… |
… | …1011100111101111101 |
3 | 102222202022200221110201 |
4 | 1310310013130331331 |
5 | 4023334133423402 |
6 | 133342050203501 |
7 | 12030142661113 |
oct | 1646407347575 |
9 | 388668627421 |
10 | 125428420477 |
11 | 49215089838 |
12 | 20385883591 |
13 | ba9ba285a9 |
14 | 60dc289ab3 |
15 | 33e1836687 |
hex | 1d341dcf7d |
125428420477 has 16 divisors (see below), whose sum is σ = 133601685120. Its totient is φ = 117344489472.
The previous prime is 125428420427. The next prime is 125428420489. The reversal of 125428420477 is 774024824521.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125428420477 is a prime.
It is a super-2 number, since 2×1254284204772 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125428420427) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4260474 + ... + 4289812.
It is an arithmetic number, because the mean of its divisors is an integer number (8350105320).
Almost surely, 2125428420477 is an apocalyptic number.
125428420477 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
125428420477 is a deficient number, since it is larger than the sum of its proper divisors (8173264643).
125428420477 is a wasteful number, since it uses less digits than its factorization.
125428420477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30852.
The product of its (nonzero) digits is 1003520, while the sum is 46.
The spelling of 125428420477 in words is "one hundred twenty-five billion, four hundred twenty-eight million, four hundred twenty thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •