Base | Representation |
---|---|
bin | 11100111100101001… |
… | …01001010011000011 |
3 | 1111010002100101121201 |
4 | 32132110221103003 |
5 | 223312011122201 |
6 | 11050044002031 |
7 | 1060060201261 |
oct | 163624512303 |
9 | 44102311551 |
10 | 15541114051 |
11 | 6655610011 |
12 | 3018830317 |
13 | 1608997a98 |
14 | a7603d431 |
15 | 60e59e801 |
hex | 39e5294c3 |
15541114051 has 32 divisors (see below), whose sum is σ = 16511014080. Its totient is φ = 14612742144.
The previous prime is 15541114031. The next prime is 15541114073. The reversal of 15541114051 is 15041114551.
15541114051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 15541114051 - 27 = 15541113923 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15541114031) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 39146185 + ... + 39146581.
It is an arithmetic number, because the mean of its divisors is an integer number (515969190).
Almost surely, 215541114051 is an apocalyptic number.
15541114051 is a deficient number, since it is larger than the sum of its proper divisors (969900029).
15541114051 is a wasteful number, since it uses less digits than its factorization.
15541114051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775.
The product of its (nonzero) digits is 2000, while the sum is 28.
The spelling of 15541114051 in words is "fifteen billion, five hundred forty-one million, one hundred fourteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •