Base | Representation |
---|---|
bin | 111010011010110001… |
… | …1000101000111110010 |
3 | 102222210222220021010112 |
4 | 1310311203011013302 |
5 | 4023411311040200 |
6 | 133344305101322 |
7 | 12030554101040 |
oct | 1646543050762 |
9 | 388728807115 |
10 | 125452440050 |
11 | 492276a5023 |
12 | 20391927842 |
13 | baa39b8462 |
14 | 610153d390 |
15 | 33e39cd535 |
hex | 1d358c51f2 |
125452440050 has 48 divisors (see below), whose sum is σ = 267143502912. Its totient is φ = 42936868800.
The previous prime is 125452440013. The next prime is 125452440059. The reversal of 125452440050 is 50044254521.
It is a junction number, because it is equal to n+sod(n) for n = 125452439989 and 125452440016.
It is not an unprimeable number, because it can be changed into a prime (125452440059) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 114017 + ... + 513716.
It is an arithmetic number, because the mean of its divisors is an integer number (5565489644).
Almost surely, 2125452440050 is an apocalyptic number.
125452440050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125452440050 is an abundant number, since it is smaller than the sum of its proper divisors (141691062862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125452440050 is a wasteful number, since it uses less digits than its factorization.
125452440050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628323 (or 628318 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 32.
Adding to 125452440050 its reverse (50044254521), we get a palindrome (175496694571).
The spelling of 125452440050 in words is "one hundred twenty-five billion, four hundred fifty-two million, four hundred forty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •