Base | Representation |
---|---|
bin | 111011001000101011… |
… | …1001101010010000001 |
3 | 110010210100102021010001 |
4 | 1312101113031102001 |
5 | 4040040131102432 |
6 | 134201213040001 |
7 | 12114000154411 |
oct | 1662127152201 |
9 | 403710367101 |
10 | 126992831617 |
11 | 49948163003 |
12 | 20741786001 |
13 | bc8ab80562 |
14 | 6209d58641 |
15 | 3483d559e7 |
hex | 1d915cd481 |
126992831617 has 24 divisors (see below), whose sum is σ = 137397012480. Its totient is φ = 117289529280.
The previous prime is 126992831597. The next prime is 126992831629. The reversal of 126992831617 is 716138299621.
It is a happy number.
It is not a de Polignac number, because 126992831617 - 27 = 126992831489 is a prime.
It is a super-2 number, since 2×1269928316172 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (126992831657) 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 23 ways as a sum of consecutive naturals, for example, 30532384 + ... + 30536542.
It is an arithmetic number, because the mean of its divisors is an integer number (5724875520).
Almost surely, 2126992831617 is an apocalyptic number.
It is an amenable number.
126992831617 is a deficient number, since it is larger than the sum of its proper divisors (10404180863).
126992831617 is a wasteful number, since it uses less digits than its factorization.
126992831617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6301 (or 6282 counting only the distinct ones).
The product of its digits is 1959552, while the sum is 55.
The spelling of 126992831617 in words is "one hundred twenty-six billion, nine hundred ninety-two million, eight hundred thirty-one thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •