Base | Representation |
---|---|
bin | 1000110010101111111… |
… | …0011101111010111011 |
3 | 112102220202010222102211 |
4 | 2030223332131322323 |
5 | 4433333240314011 |
6 | 153221411235551 |
7 | 13625306564026 |
oct | 2145376357273 |
9 | 472822128384 |
10 | 151061651131 |
11 | 59079400386 |
12 | 2533a2a8bb7 |
13 | 113254c3cb1 |
14 | 745078a1bd |
15 | 3de1ddcb21 |
hex | 232bf9debb |
151061651131 has 2 divisors, whose sum is σ = 151061651132. Its totient is φ = 151061651130.
The previous prime is 151061651087. The next prime is 151061651141. The reversal of 151061651131 is 131156160151.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151061651131 - 211 = 151061649083 is a prime.
It is a super-2 number, since 2×1510616511312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 151061651093 and 151061651102.
It is not a weakly prime, because it can be changed into another prime (151061651141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75530825565 + 75530825566.
It is an arithmetic number, because the mean of its divisors is an integer number (75530825566).
Almost surely, 2151061651131 is an apocalyptic number.
151061651131 is a deficient number, since it is larger than the sum of its proper divisors (1).
151061651131 is an equidigital number, since it uses as much as digits as its factorization.
151061651131 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 spelling of 151061651131 in words is "one hundred fifty-one billion, sixty-one million, six hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •