Base | Representation |
---|---|
bin | 110101110110110101… |
… | …0100010100110010010 |
3 | 102001112022010000220012 |
4 | 1223231222202212102 |
5 | 3343331031023100 |
6 | 125044252114522 |
7 | 11233035020624 |
oct | 1535552424622 |
9 | 361468100805 |
10 | 115656501650 |
11 | 45060097568 |
12 | 1a4b9165a42 |
13 | aba2377bc1 |
14 | 5852538c14 |
15 | 301d9cd135 |
hex | 1aedaa2992 |
115656501650 has 96 divisors (see below), whose sum is σ = 227991836160. Its totient is φ = 43561140480.
The previous prime is 115656501619. The next prime is 115656501721. The reversal of 115656501650 is 56105656511.
It is a junction number, because it is equal to n+sod(n) for n = 115656501598 and 115656501607.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 33885344 + ... + 33888756.
It is an arithmetic number, because the mean of its divisors is an integer number (2374914960).
Almost surely, 2115656501650 is an apocalyptic number.
115656501650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115656501650 is a deficient number, since it is larger than the sum of its proper divisors (112335334510).
115656501650 is a wasteful number, since it uses less digits than its factorization.
115656501650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3900 (or 3895 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 41.
The spelling of 115656501650 in words is "one hundred fifteen billion, six hundred fifty-six million, five hundred one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •