Base | Representation |
---|---|
bin | 10100010111000110… |
… | …10101110011011011 |
3 | 1001012211001010020002 |
4 | 22023203111303123 |
5 | 134341343410323 |
6 | 5004410123215 |
7 | 534612636641 |
oct | 121343256333 |
9 | 31184033202 |
10 | 10931231963 |
11 | 46aa439403 |
12 | 2150a2050b |
13 | 10528ca7c2 |
14 | 759acd191 |
15 | 43ea08828 |
hex | 28b8d5cdb |
10931231963 has 2 divisors, whose sum is σ = 10931231964. Its totient is φ = 10931231962.
The previous prime is 10931231911. The next prime is 10931232001. The reversal of 10931231963 is 36913213901.
It is an a-pointer prime, because the next prime (10931232001) can be obtained adding 10931231963 to its sum of digits (38).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10931231963 - 216 = 10931166427 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10931231063) 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, 5465615981 + 5465615982.
It is an arithmetic number, because the mean of its divisors is an integer number (5465615982).
Almost surely, 210931231963 is an apocalyptic number.
10931231963 is a deficient number, since it is larger than the sum of its proper divisors (1).
10931231963 is an equidigital number, since it uses as much as digits as its factorization.
10931231963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26244, while the sum is 38.
The spelling of 10931231963 in words is "ten billion, nine hundred thirty-one million, two hundred thirty-one thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •