Base | Representation |
---|---|
bin | 10100011001101110… |
… | …10001111100011011 |
3 | 1001021100110001102201 |
4 | 22030313101330123 |
5 | 134413012030001 |
6 | 5010513511031 |
7 | 535300654246 |
oct | 121467217433 |
9 | 31240401381 |
10 | 10953236251 |
11 | 47108a8571 |
12 | 2158272477 |
13 | 10573332a9 |
14 | 75c9ba25d |
15 | 441903501 |
hex | 28cdd1f1b |
10953236251 has 2 divisors, whose sum is σ = 10953236252. Its totient is φ = 10953236250.
The previous prime is 10953236237. The next prime is 10953236263. The reversal of 10953236251 is 15263235901.
It is a strong prime.
It is an emirp because it is prime and its reverse (15263235901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10953236251 - 211 = 10953234203 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10953236251.
It is not a weakly prime, because it can be changed into another prime (10953236201) 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, 5476618125 + 5476618126.
It is an arithmetic number, because the mean of its divisors is an integer number (5476618126).
Almost surely, 210953236251 is an apocalyptic number.
10953236251 is a deficient number, since it is larger than the sum of its proper divisors (1).
10953236251 is an equidigital number, since it uses as much as digits as its factorization.
10953236251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 10953236251 in words is "ten billion, nine hundred fifty-three million, two hundred thirty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •