Base | Representation |
---|---|
bin | 111010111110011000… |
… | …1100001011110100110 |
3 | 110002220021102221202010 |
4 | 1311330301201132212 |
5 | 4033333214033200 |
6 | 134103033255050 |
7 | 12102304132155 |
oct | 1657461413646 |
9 | 402807387663 |
10 | 126647408550 |
11 | 497901845a3 |
12 | 20665b64486 |
13 | bc3443a700 |
14 | 61b611d59c |
15 | 3463873150 |
hex | 1d7cc617a6 |
126647408550 has 72 divisors (see below), whose sum is σ = 340104564504. Its totient is φ = 31174740480.
The previous prime is 126647408533. The next prime is 126647408557. The reversal of 126647408550 is 55804746621.
It is a super-2 number, since 2×1266474085502 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 126647408550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126647408557) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2472627 + ... + 2523326.
It is an arithmetic number, because the mean of its divisors is an integer number (4723674507).
Almost surely, 2126647408550 is an apocalyptic number.
126647408550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
126647408550 is an abundant number, since it is smaller than the sum of its proper divisors (213457155954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126647408550 is a wasteful number, since it uses less digits than its factorization.
126647408550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4995994 (or 4995976 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 48.
The spelling of 126647408550 in words is "one hundred twenty-six billion, six hundred forty-seven million, four hundred eight thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •