Base | Representation |
---|---|
bin | 1101101111110101110110… |
… | …0101111110010001010100 |
3 | 1222112000220101011020122211 |
4 | 3123331131211332101110 |
5 | 3440123131344300400 |
6 | 52051554212403204 |
7 | 3120030446232154 |
oct | 333753545762124 |
9 | 58460811136584 |
10 | 15115560150100 |
11 | 48a8522708763 |
12 | 18415b6616504 |
13 | 858511630717 |
14 | 3a38502cc764 |
15 | 1b32cc95ddba |
hex | dbf5d97e454 |
15115560150100 has 72 divisors (see below), whose sum is σ = 32857078262400. Its totient is φ = 6035852709120.
The previous prime is 15115560150091. The next prime is 15115560150101. The reversal of 15115560150100 is 105106551151.
It is a super-5 number, since 5×151155601501005 (a number of 67 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15115560150101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 139148007 + ... + 139256593.
It is an arithmetic number, because the mean of its divisors is an integer number (456348309200).
Almost surely, 215115560150100 is an apocalyptic number.
15115560150100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
15115560150100 is an abundant number, since it is smaller than the sum of its proper divisors (17741518112300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15115560150100 is a wasteful number, since it uses less digits than its factorization.
15115560150100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110977 (or 110970 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 15115560150100 in words is "fifteen trillion, one hundred fifteen billion, five hundred sixty million, one hundred fifty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •