Base | Representation |
---|---|
bin | 111011000110110001… |
… | …0011000001100110100 |
3 | 110010121212122112221101 |
4 | 1312031202120030310 |
5 | 4034422213313220 |
6 | 134151001255444 |
7 | 12112260506161 |
oct | 1661542301464 |
9 | 403555575841 |
10 | 126928651060 |
11 | 49914a07222 |
12 | 20724194584 |
13 | bc7a79b7b3 |
14 | 620160d068 |
15 | 347d3c930a |
hex | 1d8d898334 |
126928651060 has 24 divisors (see below), whose sum is σ = 266590356480. Its totient is φ = 50763805344.
The previous prime is 126928651027. The next prime is 126928651123. The reversal of 126928651060 is 60156829621.
It is a super-2 number, since 2×1269286510602 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 126928651060.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341524 + ... + 608683.
It is an arithmetic number, because the mean of its divisors is an integer number (11107931520).
Almost surely, 2126928651060 is an apocalyptic number.
126928651060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
126928651060 is an abundant number, since it is smaller than the sum of its proper divisors (139661705420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126928651060 is a wasteful number, since it uses less digits than its factorization.
126928651060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 956895 (or 956893 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 46.
The spelling of 126928651060 in words is "one hundred twenty-six billion, nine hundred twenty-eight million, six hundred fifty-one thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •