Base | Representation |
---|---|
bin | 111010101101011000… |
… | …0010101001010010001 |
3 | 110001102111111110110212 |
4 | 1311122300111022101 |
5 | 4031201111424414 |
6 | 133530244333505 |
7 | 12052204006151 |
oct | 1653260251221 |
9 | 401374443425 |
10 | 126076670609 |
11 | 49517aa274a |
12 | 205269a4295 |
13 | bb73118c56 |
14 | 61603d2761 |
15 | 342d6d583e |
hex | 1d5ac15291 |
126076670609 has 2 divisors, whose sum is σ = 126076670610. Its totient is φ = 126076670608.
The previous prime is 126076670593. The next prime is 126076670659. The reversal of 126076670609 is 906076670621.
It is an a-pointer prime, because the next prime (126076670659) can be obtained adding 126076670609 to its sum of digits (50).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79538100625 + 46538569984 = 282025^2 + 215728^2 .
It is an emirp because it is prime and its reverse (906076670621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126076670609 - 24 = 126076670593 is a prime.
It is not a weakly prime, because it can be changed into another prime (126076670659) 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 as a sum of consecutive naturals, namely, 63038335304 + 63038335305.
It is an arithmetic number, because the mean of its divisors is an integer number (63038335305).
Almost surely, 2126076670609 is an apocalyptic number.
It is an amenable number.
126076670609 is a deficient number, since it is larger than the sum of its proper divisors (1).
126076670609 is an equidigital number, since it uses as much as digits as its factorization.
126076670609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 50.
The spelling of 126076670609 in words is "one hundred twenty-six billion, seventy-six million, six hundred seventy thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •