Base | Representation |
---|---|
bin | 10010111000110010… |
… | …11100110110011101 |
3 | 222011200101222020102 |
4 | 21130121130312131 |
5 | 131231332011422 |
6 | 4354105430445 |
7 | 506165341415 |
oct | 113431346635 |
9 | 28150358212 |
10 | 10140110237 |
11 | 43339119a4 |
12 | 1b6ba9b425 |
13 | c57a35a3a |
14 | 6c29d5645 |
15 | 3e5337192 |
hex | 25c65cd9d |
10140110237 has 2 divisors, whose sum is σ = 10140110238. Its totient is φ = 10140110236.
The previous prime is 10140110177. The next prime is 10140110291. The reversal of 10140110237 is 73201104101.
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., 7903387801 + 2236722436 = 88901^2 + 47294^2 .
It is a cyclic number.
It is not a de Polignac number, because 10140110237 - 220 = 10139061661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140119237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070055118 + 5070055119.
It is an arithmetic number, because the mean of its divisors is an integer number (5070055119).
Almost surely, 210140110237 is an apocalyptic number.
It is an amenable number.
10140110237 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140110237 is an equidigital number, since it uses as much as digits as its factorization.
10140110237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 10140110237 its reverse (73201104101), we get a palindrome (83341214338).
The spelling of 10140110237 in words is "ten billion, one hundred forty million, one hundred ten thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •