Base | Representation |
---|---|
bin | 11100011110001011110111… |
… | …011111000110000001000000 |
3 | 121102100212202012222122112100 |
4 | 130132023313133012001000 |
5 | 112403044244414433130 |
6 | 1122153034150030400 |
7 | 35242551062640441 |
oct | 3436136737060100 |
9 | 542325665878470 |
10 | 125219628671040 |
11 | 36998389a08a52 |
12 | 120644a0348400 |
13 | 54b42112a4547 |
14 | 22cc93b75d2c8 |
15 | e723b3668c60 |
hex | 71e2f77c6040 |
125219628671040 has 168 divisors, whose sum is σ = 453371945232960. Its totient is φ = 31634432492544.
The previous prime is 125219628670987. The next prime is 125219628671041. The reversal of 125219628671040 is 40176826912521.
125219628671040 is a `hidden beast` number, since 1 + 2 + 5 + 2 + 1 + 9 + 628 + 6 + 7 + 1 + 0 + 4 + 0 = 666.
It is not an unprimeable number, because it can be changed into a prime (125219628671041) 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 23 ways as a sum of consecutive naturals, for example, 1144130484 + ... + 1144239923.
Almost surely, 2125219628671040 is an apocalyptic number.
125219628671040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125219628671040 is an abundant number, since it is smaller than the sum of its proper divisors (328152316561920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125219628671040 is a wasteful number, since it uses less digits than its factorization.
125219628671040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2288370449 (or 2288370436 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 54.
The spelling of 125219628671040 in words is "one hundred twenty-five trillion, two hundred nineteen billion, six hundred twenty-eight million, six hundred seventy-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •