Base | Representation |
---|---|
bin | 10011011110100000… |
… | …11001001101101111 |
3 | 222222201202101201111 |
4 | 21233100121031233 |
5 | 132403331100101 |
6 | 4445331052451 |
7 | 520056544633 |
oct | 115720311557 |
9 | 28881671644 |
10 | 10456503151 |
11 | 4486472646 |
12 | 2039a41127 |
13 | ca8453193 |
14 | 712a34dc3 |
15 | 412ed3251 |
hex | 26f41936f |
10456503151 has 2 divisors, whose sum is σ = 10456503152. Its totient is φ = 10456503150.
The previous prime is 10456503131. The next prime is 10456503163. The reversal of 10456503151 is 15130565401.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10456503151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10456503131) 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, 5228251575 + 5228251576.
It is an arithmetic number, because the mean of its divisors is an integer number (5228251576).
Almost surely, 210456503151 is an apocalyptic number.
10456503151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10456503151 is an equidigital number, since it uses as much as digits as its factorization.
10456503151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 10456503151 in words is "ten billion, four hundred fifty-six million, five hundred three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •