Base | Representation |
---|---|
bin | 11100011101111101101111… |
… | …100011100000110101110110 |
3 | 121102022102121022112020020020 |
4 | 130131331233203200311312 |
5 | 112402322220041214410 |
6 | 1122142045241550010 |
7 | 35241503213533563 |
oct | 3435755743406566 |
9 | 542272538466206 |
10 | 125204463226230 |
11 | 36991a07465893 |
12 | 120615694a5306 |
13 | 54b29653ac66b |
14 | 22cbcdd58d86a |
15 | e71cc7073a70 |
hex | 71df6f8e0d76 |
125204463226230 has 64 divisors (see below), whose sum is σ = 300669050013696. Its totient is φ = 33368043632000.
The previous prime is 125204463226217. The next prime is 125204463226247. The reversal of 125204463226230 is 32622364402521.
It is a super-2 number, since 2×1252044632262302 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1122039040 + ... + 1122150620.
It is an arithmetic number, because the mean of its divisors is an integer number (4697953906464).
Almost surely, 2125204463226230 is an apocalyptic number.
125204463226230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
125204463226230 is an abundant number, since it is smaller than the sum of its proper divisors (175464586787466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125204463226230 is a wasteful number, since it uses less digits than its factorization.
125204463226230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133453.
The product of its (nonzero) digits is 829440, while the sum is 42.
The spelling of 125204463226230 in words is "one hundred twenty-five trillion, two hundred four billion, four hundred sixty-three million, two hundred twenty-six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •