Base | Representation |
---|---|
bin | 1101110000001011101001… |
… | …1100111100110011000001 |
3 | 1222112121000021101111211020 |
4 | 3130002322130330303001 |
5 | 3440222123214030103 |
6 | 52054403052140053 |
7 | 3120325466016150 |
oct | 334027234746301 |
9 | 58477007344736 |
10 | 15121413033153 |
11 | 48aaa56496399 |
12 | 184276a767629 |
13 | 858c3509992b |
14 | 3a3c47763597 |
15 | 1b35216d6753 |
hex | dc0ba73ccc1 |
15121413033153 has 8 divisors (see below), whose sum is σ = 23042153193408. Its totient is φ = 8640807447504.
The previous prime is 15121413033127. The next prime is 15121413033173. The reversal of 15121413033153 is 35133031412151.
15121413033153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-15121413033153 is a prime.
It is a super-2 number, since 2×151214130331532 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (15121413033113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 360033643626 + ... + 360033643667.
It is an arithmetic number, because the mean of its divisors is an integer number (2880269149176).
Almost surely, 215121413033153 is an apocalyptic number.
It is an amenable number.
15121413033153 is a deficient number, since it is larger than the sum of its proper divisors (7920740160255).
15121413033153 is an equidigital number, since it uses as much as digits as its factorization.
15121413033153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 720067287303.
The product of its (nonzero) digits is 16200, while the sum is 33.
The spelling of 15121413033153 in words is "fifteen trillion, one hundred twenty-one billion, four hundred thirteen million, thirty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •