Base | Representation |
---|---|
bin | 1000110011011111111… |
… | …1001001011110100011 |
3 | 112110102210022111022222 |
4 | 2030313333021132203 |
5 | 4434241331444011 |
6 | 153253410221255 |
7 | 13633304420123 |
oct | 2146777113643 |
9 | 473383274288 |
10 | 151263156131 |
11 | 5917212103a |
12 | 2539588482b |
13 | 11358187319 |
14 | 746d440c83 |
15 | 3e04942ddb |
hex | 2337fc97a3 |
151263156131 has 12 divisors (see below), whose sum is σ = 157360058856. Its totient is φ = 145323198720.
The previous prime is 151263156073. The next prime is 151263156137. The reversal of 151263156131 is 131651362151.
It is a de Polignac number, because none of the positive numbers 2k-151263156131 is a prime.
It is a super-2 number, since 2×1512631561312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 151263156091 and 151263156100.
It is not an unprimeable number, because it can be changed into a prime (151263156137) 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 in 11 ways as a sum of consecutive naturals, for example, 312686 + ... + 632691.
It is an arithmetic number, because the mean of its divisors is an integer number (13113338238).
Almost surely, 2151263156131 is an apocalyptic number.
151263156131 is a deficient number, since it is larger than the sum of its proper divisors (6096902725).
151263156131 is an frugal number, since it uses more digits than its factorization.
151263156131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945542 (or 945481 counting only the distinct ones).
The product of its digits is 16200, while the sum is 35.
The spelling of 151263156131 in words is "one hundred fifty-one billion, two hundred sixty-three million, one hundred fifty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •