Base | Representation |
---|---|
bin | 11100000010011110… |
… | …11101011100011000 |
3 | 1102212002021120122110 |
4 | 32001033131130120 |
5 | 221312110344022 |
6 | 10525414352320 |
7 | 1042014135456 |
oct | 160117353430 |
9 | 42762246573 |
10 | 15053215512 |
11 | 6425169685 |
12 | 2b0135b6a0 |
13 | 155b88bc1a |
14 | a2b3179d6 |
15 | 5d182700c |
hex | 3813dd718 |
15053215512 has 64 divisors (see below), whose sum is σ = 38035537920. Its totient is φ = 4964295168.
The previous prime is 15053215493. The next prime is 15053215523. The reversal of 15053215512 is 21551235051.
15053215512 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 15053215512.
It is a congruent number.
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, 1111888 + ... + 1125344.
It is an arithmetic number, because the mean of its divisors is an integer number (594305280).
Almost surely, 215053215512 is an apocalyptic number.
15053215512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
15053215512 is an abundant number, since it is smaller than the sum of its proper divisors (22982322408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15053215512 is a wasteful number, since it uses less digits than its factorization.
15053215512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13960 (or 13956 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 30.
The spelling of 15053215512 in words is "fifteen billion, fifty-three million, two hundred fifteen thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •