Base | Representation |
---|---|
bin | 10011110100011011… |
… | …10000111100000011 |
3 | 1000110112201110101102 |
4 | 21322031300330003 |
5 | 133242413111032 |
6 | 4515455525015 |
7 | 524451411152 |
oct | 117215607403 |
9 | 30415643342 |
10 | 10640363267 |
11 | 4570231456 |
12 | 208b52976b |
13 | 1007579051 |
14 | 72d215599 |
15 | 424200362 |
hex | 27a370f03 |
10640363267 has 2 divisors, whose sum is σ = 10640363268. Its totient is φ = 10640363266.
The previous prime is 10640363203. The next prime is 10640363309. The reversal of 10640363267 is 76236304601.
10640363267 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 is a cyclic number.
It is not a de Polignac number, because 10640363267 - 26 = 10640363203 is a prime.
It is a super-2 number, since 2×106403632672 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10640363267.
It is not a weakly prime, because it can be changed into another prime (10640360267) 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, 5320181633 + 5320181634.
It is an arithmetic number, because the mean of its divisors is an integer number (5320181634).
Almost surely, 210640363267 is an apocalyptic number.
10640363267 is a deficient number, since it is larger than the sum of its proper divisors (1).
10640363267 is an equidigital number, since it uses as much as digits as its factorization.
10640363267 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 38.
Adding to 10640363267 its reverse (76236304601), we get a palindrome (86876667868).
The spelling of 10640363267 in words is "ten billion, six hundred forty million, three hundred sixty-three thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •