Base | Representation |
---|---|
bin | 1000110010101101001… |
… | …0000101010101000001 |
3 | 112102212221020212010110 |
4 | 2030223102011111001 |
5 | 4433322301003230 |
6 | 153220314021533 |
7 | 13625105644404 |
oct | 2145322052501 |
9 | 472787225113 |
10 | 151050016065 |
11 | 59072883823 |
12 | 253364178a9 |
13 | 11322c7c140 |
14 | 744cddbd3b |
15 | 3de0d904b0 |
hex | 232b485541 |
151050016065 has 32 divisors (see below), whose sum is σ = 263936606976. Its totient is φ = 73315710720.
The previous prime is 151050016049. The next prime is 151050016087. The reversal of 151050016065 is 560610050151.
It is not a de Polignac number, because 151050016065 - 24 = 151050016049 is a prime.
It is a super-2 number, since 2×1510500160652 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5441194 + ... + 5468883.
It is an arithmetic number, because the mean of its divisors is an integer number (8248018968).
Almost surely, 2151050016065 is an apocalyptic number.
151050016065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
151050016065 is a deficient number, since it is larger than the sum of its proper divisors (112886590911).
151050016065 is a wasteful number, since it uses less digits than its factorization.
151050016065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10910169.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 151050016065 in words is "one hundred fifty-one billion, fifty million, sixteen thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •