Base | Representation |
---|---|
bin | 111010100111011101… |
… | …1110001100100100000 |
3 | 110000220200022102110201 |
4 | 1311032323301210200 |
5 | 4030244324001333 |
6 | 133454441434544 |
7 | 12044245161316 |
oct | 1651673614440 |
9 | 400820272421 |
10 | 125878343968 |
11 | 49426052a33 |
12 | 2049049ba54 |
13 | bb40cc9500 |
14 | 6141d280b6 |
15 | 341b0ac17d |
hex | 1d4eef1920 |
125878343968 has 72 divisors (see below), whose sum is σ = 268532914608. Its totient is φ = 58058687232.
The previous prime is 125878343923. The next prime is 125878344073. The reversal of 125878343968 is 869343878521.
It is a super-2 number, since 2×1258783439682 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9008155 + ... + 9022117.
It is an arithmetic number, because the mean of its divisors is an integer number (3729623814).
Almost surely, 2125878343968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 125878343968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134266457304).
125878343968 is an abundant number, since it is smaller than the sum of its proper divisors (142654570640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125878343968 is a wasteful number, since it uses less digits than its factorization.
125878343968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15666 (or 15645 counting only the distinct ones).
The product of its digits is 69672960, while the sum is 64.
The spelling of 125878343968 in words is "one hundred twenty-five billion, eight hundred seventy-eight million, three hundred forty-three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •