Base | Representation |
---|---|
bin | 11100001101011101… |
… | …10000010000010110 |
3 | 1110002111120012211022 |
4 | 32012232300100112 |
5 | 222004144230420 |
6 | 10542504241142 |
7 | 1044212653325 |
oct | 160656602026 |
9 | 43074505738 |
10 | 15145305110 |
11 | 6472147991 |
12 | 2b281701b2 |
13 | 1574993000 |
14 | a3964a0bc |
15 | 5d9967c25 |
hex | 386bb0416 |
15145305110 has 64 divisors (see below), whose sum is σ = 29976004800. Its totient is φ = 5508112896.
The previous prime is 15145305103. The next prime is 15145305143. The reversal of 15145305110 is 1150354151.
It is a super-2 number, since 2×151453051102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 15145305110.
It is a congruent number.
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, 1466846 + ... + 1477134.
It is an arithmetic number, because the mean of its divisors is an integer number (468375075).
Almost surely, 215145305110 is an apocalyptic number.
15145305110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15145305110 is a deficient number, since it is larger than the sum of its proper divisors (14830699690).
15145305110 is a wasteful number, since it uses less digits than its factorization.
15145305110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10402 (or 10376 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 15145305110 its reverse (1150354151), we get a palindrome (16295659261).
The spelling of 15145305110 in words is "fifteen billion, one hundred forty-five million, three hundred five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •