Base | Representation |
---|---|
bin | 1000110011110110111… |
… | …1101011011100100101 |
3 | 112110200112002200202212 |
4 | 2030331233223130211 |
5 | 4434441044424021 |
6 | 153311141013205 |
7 | 13635556524356 |
oct | 2147557533445 |
9 | 473615080685 |
10 | 151359764261 |
11 | 59211706172 |
12 | 254020b4205 |
13 | 113721b0cb4 |
14 | 747c1cbd2d |
15 | 3e0d17785b |
hex | 233dbeb725 |
151359764261 has 2 divisors, whose sum is σ = 151359764262. Its totient is φ = 151359764260.
The previous prime is 151359764183. The next prime is 151359764263. The reversal of 151359764261 is 162467953151.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117501556225 + 33858208036 = 342785^2 + 184006^2 .
It is a cyclic number.
It is not a de Polignac number, because 151359764261 - 218 = 151359502117 is a prime.
It is a super-2 number, since 2×1513597642612 (a number of 23 digits) contains 22 as substring.
Together with 151359764263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151359764263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75679882130 + 75679882131.
It is an arithmetic number, because the mean of its divisors is an integer number (75679882131).
Almost surely, 2151359764261 is an apocalyptic number.
It is an amenable number.
151359764261 is a deficient number, since it is larger than the sum of its proper divisors (1).
151359764261 is an equidigital number, since it uses as much as digits as its factorization.
151359764261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1360800, while the sum is 50.
The spelling of 151359764261 in words is "one hundred fifty-one billion, three hundred fifty-nine million, seven hundred sixty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •