Base | Representation |
---|---|
bin | 1000110010101110101… |
… | …0111110000101111111 |
3 | 112102220101112022022211 |
4 | 2030223222332011333 |
5 | 4433330433240111 |
6 | 153221105521251 |
7 | 13625215255615 |
oct | 2145352760577 |
9 | 472811468284 |
10 | 151056540031 |
11 | 5907652a331 |
12 | 25338643227 |
13 | 11324424787 |
14 | 744dc196b5 |
15 | 3de172d521 |
hex | 232babe17f |
151056540031 has 4 divisors (see below), whose sum is σ = 151070733064. Its totient is φ = 151042347000.
The previous prime is 151056539911. The next prime is 151056540077. The reversal of 151056540031 is 130045650151.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 151056540031 - 217 = 151056408959 is a prime.
It is a super-2 number, since 2×1510565400312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 151056539975 and 151056540002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151056540091) 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 3 ways as a sum of consecutive naturals, for example, 7080540 + ... + 7101841.
It is an arithmetic number, because the mean of its divisors is an integer number (37767683266).
Almost surely, 2151056540031 is an apocalyptic number.
151056540031 is a deficient number, since it is larger than the sum of its proper divisors (14193033).
151056540031 is a wasteful number, since it uses less digits than its factorization.
151056540031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14193032.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 151056540031 in words is "one hundred fifty-one billion, fifty-six million, five hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •