Base | Representation |
---|---|
bin | 11100000001000011… |
… | …11101011101110010 |
3 | 1102211020211121020121 |
4 | 32000201331131302 |
5 | 221301032204200 |
6 | 10524311000454 |
7 | 1041510560515 |
oct | 160041753562 |
9 | 42736747217 |
10 | 15041288050 |
11 | 6419462378 |
12 | 2ab936912a |
13 | 1559273c59 |
14 | a298d0d7c |
15 | 5d076ce1a |
hex | 38087d772 |
15041288050 has 24 divisors (see below), whose sum is σ = 29622491316. Its totient is φ = 5662602240.
The previous prime is 15041287997. The next prime is 15041288057. The reversal of 15041288050 is 5088214051.
15041288050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 6659702449 + 8381585601 = 81607^2 + 91551^2 .
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a junction number, because it is equal to n+sod(n) for n = 15041287997 and 15041288015.
It is not an unprimeable number, because it can be changed into a prime (15041288057) 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 11 ways as a sum of consecutive naturals, for example, 8846967 + ... + 8848666.
Almost surely, 215041288050 is an apocalyptic number.
15041288050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15041288050 is a deficient number, since it is larger than the sum of its proper divisors (14581203266).
15041288050 is a wasteful number, since it uses less digits than its factorization.
15041288050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17695662 (or 17695657 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 34.
The spelling of 15041288050 in words is "fifteen billion, forty-one million, two hundred eighty-eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •