Base | Representation |
---|---|
bin | 111010100101011010… |
… | …0001101100001000000 |
3 | 110000201212022012200100 |
4 | 1311022310031201000 |
5 | 4030124132034131 |
6 | 133443532522400 |
7 | 12042446000241 |
oct | 1651264154100 |
9 | 400655265610 |
10 | 125809252416 |
11 | 493a0052481 |
12 | 20471320400 |
13 | bb2c8b8333 |
14 | 6136aa0cc8 |
15 | 3414eb07e6 |
hex | 1d4ad0d840 |
125809252416 has 63 divisors (see below), whose sum is σ = 360633908271. Its totient is φ = 41933579904.
The previous prime is 125809252357. The next prime is 125809252417. The reversal of 125809252416 is 614252908521.
The square root of 125809252416 is 354696.
It is a perfect power (a square), and thus also a powerful number.
125809252416 is a `hidden beast` number, since 1 + 2 + 580 + 9 + 2 + 52 + 4 + 16 = 666.
It is not an unprimeable number, because it can be changed into a prime (125809252417) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 8505315 + ... + 8520093.
Almost surely, 2125809252416 is an apocalyptic number.
125809252416 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
125809252416 is the 354696-th square number.
It is an amenable number.
125809252416 is an abundant number, since it is smaller than the sum of its proper divisors (234824655855).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
125809252416 is an frugal number, since it uses more digits than its factorization.
125809252416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29576 (or 14784 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 45.
It can be divided in two parts, 125809 and 252416, that added together give a square (378225 = 6152).
The spelling of 125809252416 in words is "one hundred twenty-five billion, eight hundred nine million, two hundred fifty-two thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •