Base | Representation |
---|---|
bin | 11100010111100011… |
… | …11000111001001000 |
3 | 1110022101221211012120 |
4 | 32023301320321020 |
5 | 222142340404000 |
6 | 10555132011240 |
7 | 1046261655156 |
oct | 161361707110 |
9 | 43271854176 |
10 | 15230013000 |
11 | 6505a44204 |
12 | 2b50600b20 |
13 | 15893b1217 |
14 | a469ba3d6 |
15 | 5e20eb6a0 |
hex | 38bc78e48 |
15230013000 has 64 divisors (see below), whose sum is σ = 47517649920. Its totient is φ = 4061336000.
The previous prime is 15230012999. The next prime is 15230013011. The reversal of 15230013000 is 31003251.
It is a happy number.
15230013000 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 (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2535336 + ... + 2541335.
It is an arithmetic number, because the mean of its divisors is an integer number (742463280).
Almost surely, 215230013000 is an apocalyptic number.
15230013000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
15230013000 is an abundant number, since it is smaller than the sum of its proper divisors (32287636920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15230013000 is a wasteful number, since it uses less digits than its factorization.
15230013000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5076695 (or 5076681 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
Adding to 15230013000 its reverse (31003251), we get a palindrome (15261016251).
The spelling of 15230013000 in words is "fifteen billion, two hundred thirty million, thirteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •