Base | Representation |
---|---|
bin | 1101101110111101110001… |
… | …0101000101011010010110 |
3 | 1222110121001021011122101022 |
4 | 3123233130111011122112 |
5 | 3434401314134411100 |
6 | 52041024342001142 |
7 | 3115655425643624 |
oct | 333573425053226 |
9 | 58417037148338 |
10 | 15100506560150 |
11 | 48a20a8313830 |
12 | 183a6b51161b2 |
13 | 856c8297024b |
14 | 3a2c22d18514 |
15 | 1b2beb0b0e85 |
hex | dbbdc545696 |
15100506560150 has 24 divisors (see below), whose sum is σ = 30640300584984. Its totient is φ = 5491093294400.
The previous prime is 15100506560147. The next prime is 15100506560203. The reversal of 15100506560150 is 5106560500151.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 15100506560150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13727732687 + ... + 13727733786.
It is an arithmetic number, because the mean of its divisors is an integer number (1276679191041).
Almost surely, 215100506560150 is an apocalyptic number.
15100506560150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15100506560150 is an abundant number, since it is smaller than the sum of its proper divisors (15539794024834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15100506560150 is a wasteful number, since it uses less digits than its factorization.
15100506560150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27455466496 (or 27455466491 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 15100506560150 in words is "fifteen trillion, one hundred billion, five hundred six million, five hundred sixty thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •