Base | Representation |
---|---|
bin | 111011000011011001… |
… | …1010010101100010101 |
3 | 110010100000000012222220 |
4 | 1312012303102230111 |
5 | 4034204301110222 |
6 | 134131443212553 |
7 | 12106416122616 |
oct | 1660663225425 |
9 | 403300005886 |
10 | 126815644437 |
11 | 49867141719 |
12 | 206b2377159 |
13 | bc60252a81 |
14 | 61d05d3c0d |
15 | 3473505b5c |
hex | 1d86cd2b15 |
126815644437 has 4 divisors (see below), whose sum is σ = 169087525920. Its totient is φ = 84543762956.
The previous prime is 126815644429. The next prime is 126815644489. The reversal of 126815644437 is 734446518621.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 126815644437 - 23 = 126815644429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 126815644437.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126815644537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21135940737 + ... + 21135940742.
It is an arithmetic number, because the mean of its divisors is an integer number (42271881480).
Almost surely, 2126815644437 is an apocalyptic number.
It is an amenable number.
126815644437 is a deficient number, since it is larger than the sum of its proper divisors (42271881483).
126815644437 is an equidigital number, since it uses as much as digits as its factorization.
126815644437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42271881482.
The product of its digits is 3870720, while the sum is 51.
The spelling of 126815644437 in words is "one hundred twenty-six billion, eight hundred fifteen million, six hundred forty-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •