Base | Representation |
---|---|
bin | 11100000010110101… |
… | …01010001000001100 |
3 | 1102212021210201110011 |
4 | 32001122222020030 |
5 | 221313333313202 |
6 | 10530001323004 |
7 | 1042051113055 |
oct | 160132521014 |
9 | 42767721404 |
10 | 15056151052 |
11 | 6426894148 |
12 | 2b02336464 |
13 | 155c379127 |
14 | a2b87d72c |
15 | 5d1c06bd7 |
hex | 3816aa20c |
15056151052 has 12 divisors (see below), whose sum is σ = 27198208576. Its totient is φ = 7285234320.
The previous prime is 15056151043. The next prime is 15056151053. The reversal of 15056151052 is 25015165051.
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is not an unprimeable number, because it can be changed into a prime (15056151053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60710163 + ... + 60710410.
Almost surely, 215056151052 is an apocalyptic number.
It is an amenable number.
15056151052 is a deficient number, since it is larger than the sum of its proper divisors (12142057524).
15056151052 is a wasteful number, since it uses less digits than its factorization.
15056151052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121420608 (or 121420606 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 31.
The spelling of 15056151052 in words is "fifteen billion, fifty-six million, one hundred fifty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •