Base | Representation |
---|---|
bin | 111010010101… |
… | …000110010100 |
3 | 1001202211222220 |
4 | 322111012110 |
5 | 12403301042 |
6 | 1303422340 |
7 | 243653340 |
oct | 72250624 |
9 | 31684886 |
10 | 15290772 |
11 | 86a4202 |
12 | 51549b0 |
13 | 3224ac3 |
14 | 2060620 |
15 | 15208ec |
hex | e95194 |
15290772 has 48 divisors (see below), whose sum is σ = 42188160. Its totient is φ = 4217472.
The previous prime is 15290771. The next prime is 15290783. The reversal of 15290772 is 27709251.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15290771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 703 + ... + 5574.
It is an arithmetic number, because the mean of its divisors is an integer number (878920).
Almost surely, 215290772 is an apocalyptic number.
15290772 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15290772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21094080).
15290772 is an abundant number, since it is smaller than the sum of its proper divisors (26897388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15290772 is a wasteful number, since it uses less digits than its factorization.
15290772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6320 (or 6318 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 33.
The square root of 15290772 is about 3910.3416730511. The cubic root of 15290772 is about 248.2045875094.
The spelling of 15290772 in words is "fifteen million, two hundred ninety thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •