Base | Representation |
---|---|
bin | 111010110000000001… |
… | …0111100010001101101 |
3 | 110001122200112012000110 |
4 | 1311200002330101231 |
5 | 4031341322414001 |
6 | 133543135050233 |
7 | 12054332336010 |
oct | 1654002742155 |
9 | 401580465013 |
10 | 126165435501 |
11 | 49563110066 |
12 | 20550670979 |
13 | bb88627961 |
14 | 616c0db377 |
15 | 34363bb3d6 |
hex | 1d600bc46d |
126165435501 has 48 divisors (see below), whose sum is σ = 205683575424. Its totient is φ = 67364172288.
The previous prime is 126165435481. The next prime is 126165435509. The reversal of 126165435501 is 105534561621.
It is not a de Polignac number, because 126165435501 - 25 = 126165435469 is a prime.
It is a super-2 number, since 2×1261654355012 (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 126165435501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126165435509) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 439425 + ... + 667401.
It is an arithmetic number, because the mean of its divisors is an integer number (4285074488).
Almost surely, 2126165435501 is an apocalyptic number.
It is an amenable number.
126165435501 is a deficient number, since it is larger than the sum of its proper divisors (79518139923).
126165435501 is a wasteful number, since it uses less digits than its factorization.
126165435501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228098 (or 228079 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 126165435501 in words is "one hundred twenty-six billion, one hundred sixty-five million, four hundred thirty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •