Base | Representation |
---|---|
bin | 111010111010010001… |
… | …0000010000011101000 |
3 | 110002112122020200011212 |
4 | 1311310202002003220 |
5 | 4033042314124320 |
6 | 134041213412252 |
7 | 12066004601453 |
oct | 1656442020350 |
9 | 402478220155 |
10 | 126509129960 |
11 | 4971a118874 |
12 | 2062779a088 |
13 | bc118b3a65 |
14 | 61a1a0649a |
15 | 345665b9c5 |
hex | 1d748820e8 |
126509129960 has 64 divisors (see below), whose sum is σ = 286442125200. Its totient is φ = 50284855296.
The previous prime is 126509129941. The next prime is 126509129963. The reversal of 126509129960 is 69921905621.
126509129960 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 701296324 + 125807833636 = 26482^2 + 354694^2 .
It is a junction number, because it is equal to n+sod(n) for n = 126509129899 and 126509129908.
It is not an unprimeable number, because it can be changed into a prime (126509129963) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7224896 + ... + 7242384.
Almost surely, 2126509129960 is an apocalyptic number.
126509129960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
126509129960 is an abundant number, since it is smaller than the sum of its proper divisors (159932995240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126509129960 is a wasteful number, since it uses less digits than its factorization.
126509129960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18630 (or 18626 counting only the distinct ones).
The product of its (nonzero) digits is 524880, while the sum is 50.
The spelling of 126509129960 in words is "one hundred twenty-six billion, five hundred nine million, one hundred twenty-nine thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •