Base | Representation |
---|---|
bin | 11100011011101111111000… |
… | …011001000011010111100000 |
3 | 121101202212102122202201010221 |
4 | 130123233320121003113200 |
5 | 112342323240333440000 |
6 | 1121544054325332424 |
7 | 35224501415626303 |
oct | 3433577031032740 |
9 | 541685378681127 |
10 | 125052140140000 |
11 | 36933351008667 |
12 | 12037b38867114 |
13 | 54a149b763c88 |
14 | 22c47ad480b3a |
15 | e6cd5e56261a |
hex | 71bbf86435e0 |
125052140140000 has 60 divisors (see below), whose sum is σ = 307647022614624. Its totient is φ = 50020856048000.
The previous prime is 125052140139977. The next prime is 125052140140003. The reversal of 125052140140000 is 41041250521.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125052140140003) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3126283504 + ... + 3126323503.
Almost surely, 2125052140140000 is an apocalyptic number.
125052140140000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
125052140140000 is an abundant number, since it is smaller than the sum of its proper divisors (182594882474624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125052140140000 is an frugal number, since it uses more digits than its factorization.
125052140140000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6252607037 (or 6252607014 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 25.
Adding to 125052140140000 its reverse (41041250521), we get a palindrome (125093181390521).
The spelling of 125052140140000 in words is "one hundred twenty-five trillion, fifty-two billion, one hundred forty million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •