Base | Representation |
---|---|
bin | 11100100000110111001110… |
… | …110101011000100011111110 |
3 | 121110000110200121101221020120 |
4 | 130200313032311120203332 |
5 | 112414103113320221141 |
6 | 1122413344334155410 |
7 | 35262053601326352 |
oct | 3440671665304376 |
9 | 543013617357216 |
10 | 125403630242046 |
11 | 36a59421007702 |
12 | 12094092052b66 |
13 | 54c8685c6a590 |
14 | 22d77d4b9b462 |
15 | e77082307c66 |
hex | 720dced588fe |
125403630242046 has 32 divisors (see below), whose sum is σ = 275196355489440. Its totient is φ = 37857699694464.
The previous prime is 125403630241979. The next prime is 125403630242131. The reversal of 125403630242046 is 640242036304521.
It is a happy number.
It is a super-2 number, since 2×1254036302420462 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 125403630241989 and 125403630242007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15167343501 + ... + 15167351768.
It is an arithmetic number, because the mean of its divisors is an integer number (8599886109045).
Almost surely, 2125403630242046 is an apocalyptic number.
125403630242046 is an abundant number, since it is smaller than the sum of its proper divisors (149792725247394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125403630242046 is a wasteful number, since it uses less digits than its factorization.
125403630242046 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30334695340.
The product of its (nonzero) digits is 829440, while the sum is 42.
Adding to 125403630242046 its reverse (640242036304521), we get a palindrome (765645666546567).
The spelling of 125403630242046 in words is "one hundred twenty-five trillion, four hundred three billion, six hundred thirty million, two hundred forty-two thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •