Base | Representation |
---|---|
bin | 11011111100001001… |
… | …01111001011100010 |
3 | 1102201101021122201200 |
4 | 31332010233023202 |
5 | 221210004313210 |
6 | 10520235342030 |
7 | 1040500342023 |
oct | 157604571342 |
9 | 42641248650 |
10 | 15000072930 |
11 | 63a8171897 |
12 | 2aa75b1916 |
13 | 15508732cb |
14 | a24242c4a |
15 | 5cbd2b0c0 |
hex | 37e12f2e2 |
15000072930 has 48 divisors (see below), whose sum is σ = 39068625024. Its totient is φ = 3993000480.
The previous prime is 15000072887. The next prime is 15000072931. The reversal of 15000072930 is 3927000051.
15000072930 is a `hidden beast` number, since 1 + 500 + 0 + 0 + 72 + 93 + 0 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 15000072894 and 15000072903.
It is not an unprimeable number, because it can be changed into a prime (15000072931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 94554 + ... + 197333.
It is an arithmetic number, because the mean of its divisors is an integer number (813929688).
Almost surely, 215000072930 is an apocalyptic number.
15000072930 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15000072930 is an abundant number, since it is smaller than the sum of its proper divisors (24068552094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15000072930 is a wasteful number, since it uses less digits than its factorization.
15000072930 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292471 (or 292468 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 27.
Adding to 15000072930 its reverse (3927000051), we get a palindrome (18927072981).
The spelling of 15000072930 in words is "fifteen billion, seventy-two thousand, nine hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •