Base | Representation |
---|---|
bin | 1001110100000111… |
… | …01011101011001111 |
3 | 111121012120111111011 |
4 | 10322003223223033 |
5 | 41242331324101 |
6 | 2230501110051 |
7 | 244366566355 |
oct | 47203535317 |
9 | 14535514434 |
10 | 5269011151 |
11 | 2264246078 |
12 | 10306b8327 |
13 | 65c7c95a1 |
14 | 37dac97d5 |
15 | 20c893751 |
hex | 13a0ebacf |
5269011151 has 2 divisors, whose sum is σ = 5269011152. Its totient is φ = 5269011150.
The previous prime is 5269011133. The next prime is 5269011227. The reversal of 5269011151 is 1511109625.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5269011151 - 219 = 5268486863 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5269011551) 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, 2634505575 + 2634505576.
It is an arithmetic number, because the mean of its divisors is an integer number (2634505576).
Almost surely, 25269011151 is an apocalyptic number.
5269011151 is a deficient number, since it is larger than the sum of its proper divisors (1).
5269011151 is an equidigital number, since it uses as much as digits as its factorization.
5269011151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 31.
The square root of 5269011151 is about 72587.9545861433. The cubic root of 5269011151 is about 1740.1086767679.
The spelling of 5269011151 in words is "five billion, two hundred sixty-nine million, eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •