Base | Representation |
---|---|
bin | 111010000110… |
… | …010001110110 |
3 | 1001122202201200 |
4 | 322012101312 |
5 | 12344330240 |
6 | 1302233330 |
7 | 243311352 |
oct | 72062166 |
9 | 31582650 |
10 | 15230070 |
11 | 8662639 |
12 | 5125846 |
13 | 320329b |
14 | 2046462 |
15 | 150c930 |
hex | e86476 |
15230070 has 48 divisors (see below), whose sum is σ = 39845520. Its totient is φ = 4036032.
The previous prime is 15230069. The next prime is 15230081. The reversal of 15230070 is 7003251.
15230070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17301 + ... + 18159.
It is an arithmetic number, because the mean of its divisors is an integer number (830115).
Almost surely, 215230070 is an apocalyptic number.
15230070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 15230070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19922760).
15230070 is an abundant number, since it is smaller than the sum of its proper divisors (24615450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15230070 is a wasteful number, since it uses less digits than its factorization.
15230070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1069 (or 1066 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 18.
The square root of 15230070 is about 3902.5722286718. The cubic root of 15230070 is about 247.8757073150.
The spelling of 15230070 in words is "fifteen million, two hundred thirty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •