Base | Representation |
---|---|
bin | 10010111001111110… |
… | …10010000010111011 |
3 | 222012101001211002122 |
4 | 21130333102002323 |
5 | 131241401334301 |
6 | 4355102151455 |
7 | 506345544524 |
oct | 113477220273 |
9 | 28171054078 |
10 | 10150027451 |
11 | 4339475943 |
12 | 1b7328258b |
13 | c59ac8a05 |
14 | 6c405784b |
15 | 3e614581b |
hex | 25cfd20bb |
10150027451 has 2 divisors, whose sum is σ = 10150027452. Its totient is φ = 10150027450.
The previous prime is 10150027439. The next prime is 10150027453. The reversal of 10150027451 is 15472005101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10150027451 - 230 = 9076285627 is a prime.
It is a Sophie Germain prime.
Together with 10150027453, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10150027451.
It is not a weakly prime, because it can be changed into another prime (10150027453) 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, 5075013725 + 5075013726.
It is an arithmetic number, because the mean of its divisors is an integer number (5075013726).
Almost surely, 210150027451 is an apocalyptic number.
10150027451 is a deficient number, since it is larger than the sum of its proper divisors (1).
10150027451 is an equidigital number, since it uses as much as digits as its factorization.
10150027451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1400, while the sum is 26.
The spelling of 10150027451 in words is "ten billion, one hundred fifty million, twenty-seven thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •