Base | Representation |
---|---|
bin | 10011110100011001… |
… | …11100111100110111 |
3 | 1000110112022122021202 |
4 | 21322030330330313 |
5 | 133242334302302 |
6 | 4515451203115 |
7 | 524446533302 |
oct | 117214747467 |
9 | 30415278252 |
10 | 10640150327 |
11 | 45700a6474 |
12 | 208b44649b |
13 | 1007503151 |
14 | 72d19bb39 |
15 | 4241ac202 |
hex | 27a33cf37 |
10640150327 has 2 divisors, whose sum is σ = 10640150328. Its totient is φ = 10640150326.
The previous prime is 10640150303. The next prime is 10640150369. The reversal of 10640150327 is 72305104601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10640150327 - 28 = 10640150071 is a prime.
It is a super-4 number, since 4×106401503274 (a number of 41 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 10640150327.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10640150387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5320075163 + 5320075164.
It is an arithmetic number, because the mean of its divisors is an integer number (5320075164).
Almost surely, 210640150327 is an apocalyptic number.
10640150327 is a deficient number, since it is larger than the sum of its proper divisors (1).
10640150327 is an equidigital number, since it uses as much as digits as its factorization.
10640150327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 10640150327 its reverse (72305104601), we get a palindrome (82945254928).
The spelling of 10640150327 in words is "ten billion, six hundred forty million, one hundred fifty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •