Base | Representation |
---|---|
bin | 10011101001111001… |
… | …00100000010111011 |
3 | 1000020101101111210002 |
4 | 21310330210002323 |
5 | 133102300433211 |
6 | 4503021143215 |
7 | 522326150621 |
oct | 116474440273 |
9 | 30211344702 |
10 | 10551967931 |
11 | 452534675a |
12 | 20659bab0b |
13 | cc216960b |
14 | 7215a5511 |
15 | 41b58e03b |
hex | 274f240bb |
10551967931 has 2 divisors, whose sum is σ = 10551967932. Its totient is φ = 10551967930.
The previous prime is 10551967903. The next prime is 10551967999. The reversal of 10551967931 is 13976915501.
10551967931 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10551967931 - 226 = 10484859067 is a prime.
It is a super-2 number, since 2×105519679312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10551963931) 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, 5275983965 + 5275983966.
It is an arithmetic number, because the mean of its divisors is an integer number (5275983966).
Almost surely, 210551967931 is an apocalyptic number.
10551967931 is a deficient number, since it is larger than the sum of its proper divisors (1).
10551967931 is an equidigital number, since it uses as much as digits as its factorization.
10551967931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 255150, while the sum is 47.
The spelling of 10551967931 in words is "ten billion, five hundred fifty-one million, nine hundred sixty-seven thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •