Base | Representation |
---|---|
bin | 1010001110011101… |
… | …01110100000100111 |
3 | 112011121102102010022 |
4 | 11013032232200213 |
5 | 42220420311101 |
6 | 2304433545355 |
7 | 253022213333 |
oct | 50716564047 |
9 | 15147372108 |
10 | 5490010151 |
11 | 2367a7097a |
12 | 109271525b |
13 | 696526922 |
14 | 3a11b67c3 |
15 | 221e99a1b |
hex | 1473ae827 |
5490010151 has 2 divisors, whose sum is σ = 5490010152. Its totient is φ = 5490010150.
The previous prime is 5490010109. The next prime is 5490010153. The reversal of 5490010151 is 1510100945.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5490010151 is a prime.
It is a super-2 number, since 2×54900101512 = 60280422916166085602, which contains 22 as substring.
Together with 5490010153, 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 5490010151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5490010153) 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, 2745005075 + 2745005076.
It is an arithmetic number, because the mean of its divisors is an integer number (2745005076).
Almost surely, 25490010151 is an apocalyptic number.
5490010151 is a deficient number, since it is larger than the sum of its proper divisors (1).
5490010151 is an equidigital number, since it uses as much as digits as its factorization.
5490010151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 26.
The square root of 5490010151 is about 74094.6027116685. The cubic root of 5490010151 is about 1764.1048033905.
The spelling of 5490010151 in words is "five billion, four hundred ninety million, ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.180 sec. • engine limits •