Base | Representation |
---|---|
bin | 1000110100000001101… |
… | …0001100110101100111 |
3 | 112110210122012202100201 |
4 | 2031000122030311213 |
5 | 4440034020344021 |
6 | 153315415051331 |
7 | 13636641502615 |
oct | 2150032146547 |
9 | 473718182321 |
10 | 151404465511 |
11 | 59234967952 |
12 | 25415070b47 |
13 | 1137b532640 |
14 | 74841066b5 |
15 | 3e12057591 |
hex | 234068cd67 |
151404465511 has 4 divisors (see below), whose sum is σ = 163050962872. Its totient is φ = 139757968152.
The previous prime is 151404465469. The next prime is 151404465517. The reversal of 151404465511 is 115564404151.
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 151404465511 - 29 = 151404464999 is a prime.
It is a super-2 number, since 2×1514044655112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151404465517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5823248661 + ... + 5823248686.
It is an arithmetic number, because the mean of its divisors is an integer number (40762740718).
Almost surely, 2151404465511 is an apocalyptic number.
151404465511 is a deficient number, since it is larger than the sum of its proper divisors (11646497361).
151404465511 is a wasteful number, since it uses less digits than its factorization.
151404465511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11646497360.
The product of its (nonzero) digits is 48000, while the sum is 37.
Adding to 151404465511 its reverse (115564404151), we get a palindrome (266968869662).
The spelling of 151404465511 in words is "one hundred fifty-one billion, four hundred four million, four hundred sixty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •