Base | Representation |
---|---|
bin | 11100000010001000… |
… | …10011011110100101 |
3 | 1102211212210000010020 |
4 | 32001010103132211 |
5 | 221310333303414 |
6 | 10525231545353 |
7 | 1041650235510 |
oct | 160104233645 |
9 | 42755700106 |
10 | 15050291109 |
11 | 6423551517 |
12 | 2b0038b259 |
13 | 155b0a6ac9 |
14 | a2ab95d77 |
15 | 5d144a7a9 |
hex | 3811137a5 |
15050291109 has 32 divisors (see below), whose sum is σ = 24008085504. Its totient is φ = 8199713280.
The previous prime is 15050290987. The next prime is 15050291161. The reversal of 15050291109 is 90119205051.
It is a happy number.
It is not a de Polignac number, because 15050291109 - 212 = 15050287013 is a prime.
It is a super-2 number, since 2×150502911092 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15050291109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15050291209) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 100117 + ... + 200309.
It is an arithmetic number, because the mean of its divisors is an integer number (750252672).
Almost surely, 215050291109 is an apocalyptic number.
It is an amenable number.
15050291109 is a deficient number, since it is larger than the sum of its proper divisors (8957794395).
15050291109 is a wasteful number, since it uses less digits than its factorization.
15050291109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100537.
The product of its (nonzero) digits is 4050, while the sum is 33.
The spelling of 15050291109 in words is "fifteen billion, fifty million, two hundred ninety-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •