Base | Representation |
---|---|
bin | 11100110110001100100011… |
… | …010100010010110101100001 |
3 | 121122012121200202100222010001 |
4 | 130312030203110102311201 |
5 | 113112113001124313022 |
6 | 1125455034252340001 |
7 | 35503012511254231 |
oct | 3466144324226541 |
9 | 548177622328101 |
10 | 126869631479137 |
11 | 37474121538228 |
12 | 12290226a74601 |
13 | 55a39a77114a1 |
14 | 2348746cabcc1 |
15 | ea0284999b27 |
hex | 736323512d61 |
126869631479137 has 8 divisors (see below), whose sum is σ = 127180283431680. Its totient is φ = 126558981757920.
The previous prime is 126869631479117. The next prime is 126869631479191. The reversal of 126869631479137 is 731974136968621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126869631479137 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 126869631479137.
It is not an unprimeable number, because it can be changed into a prime (126869631479117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216552312 + ... + 217137382.
It is an arithmetic number, because the mean of its divisors is an integer number (15897535428960).
Almost surely, 2126869631479137 is an apocalyptic number.
It is an amenable number.
126869631479137 is a deficient number, since it is larger than the sum of its proper divisors (310651952543).
126869631479137 is an equidigital number, since it uses as much as digits as its factorization.
126869631479137 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1115663.
The product of its digits is 493807104, while the sum is 73.
The spelling of 126869631479137 in words is "one hundred twenty-six trillion, eight hundred sixty-nine billion, six hundred thirty-one million, four hundred seventy-nine thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •