Base | Representation |
---|---|
bin | 111010110100001011… |
… | …1011101111011110001 |
3 | 110002000102012112010002 |
4 | 1311220113131323301 |
5 | 4032133042041334 |
6 | 134005043115345 |
7 | 12060646034432 |
oct | 1655027357361 |
9 | 402012175102 |
10 | 126305033969 |
11 | 496249984a4 |
12 | 2058b372b55 |
13 | bbab5242ba |
14 | 6182879489 |
15 | 3443793b7e |
hex | 1d685ddef1 |
126305033969 has 2 divisors, whose sum is σ = 126305033970. Its totient is φ = 126305033968.
The previous prime is 126305033929. The next prime is 126305033989. The reversal of 126305033969 is 969330503621.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126152832400 + 152201569 = 355180^2 + 12337^2 .
It is an emirp because it is prime and its reverse (969330503621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126305033969 - 236 = 57585557233 is a prime.
It is a super-2 number, since 2×1263050339692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (126305033929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63152516984 + 63152516985.
It is an arithmetic number, because the mean of its divisors is an integer number (63152516985).
Almost surely, 2126305033969 is an apocalyptic number.
It is an amenable number.
126305033969 is a deficient number, since it is larger than the sum of its proper divisors (1).
126305033969 is an equidigital number, since it uses as much as digits as its factorization.
126305033969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 787320, while the sum is 47.
The spelling of 126305033969 in words is "one hundred twenty-six billion, three hundred five million, thirty-three thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •