Base | Representation |
---|---|
bin | 10101101111001101… |
… | …00100000100101101 |
3 | 1010010022200100210022 |
4 | 22313212210010231 |
5 | 142400042234344 |
6 | 5210010251525 |
7 | 562125460316 |
oct | 126746440455 |
9 | 33108610708 |
10 | 11670274349 |
11 | 4a49624938 |
12 | 2318426ba5 |
13 | 113ca598a6 |
14 | 7c9d0b60d |
15 | 48483e0ee |
hex | 2b79a412d |
11670274349 has 2 divisors, whose sum is σ = 11670274350. Its totient is φ = 11670274348.
The previous prime is 11670274339. The next prime is 11670274351. The reversal of 11670274349 is 94347207611.
It is a happy number.
11670274349 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10260271849 + 1410002500 = 101293^2 + 37550^2 .
It is a cyclic number.
It is not a de Polignac number, because 11670274349 - 28 = 11670274093 is a prime.
Together with 11670274351, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11670274339) 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, 5835137174 + 5835137175.
It is an arithmetic number, because the mean of its divisors is an integer number (5835137175).
Almost surely, 211670274349 is an apocalyptic number.
It is an amenable number.
11670274349 is a deficient number, since it is larger than the sum of its proper divisors (1).
11670274349 is an equidigital number, since it uses as much as digits as its factorization.
11670274349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 254016, while the sum is 44.
The spelling of 11670274349 in words is "eleven billion, six hundred seventy million, two hundred seventy-four thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •