Base | Representation |
---|---|
bin | 110110010000000000… |
… | …0110100000011110000 |
3 | 102010201011120012202100 |
4 | 1230200000310003300 |
5 | 3402043301414021 |
6 | 125304145020400 |
7 | 11263002604425 |
oct | 1544000640360 |
9 | 363634505670 |
10 | 116501201136 |
11 | 45453988811 |
12 | 1a6b4024700 |
13 | aca837b698 |
14 | 58d27bbd4c |
15 | 306cc34626 |
hex | 1b200340f0 |
116501201136 has 30 divisors (see below), whose sum is σ = 326041556360. Its totient is φ = 38833733664.
The previous prime is 116501201129. The next prime is 116501201143. The reversal of 116501201136 is 631102105611.
116501201136 is a `hidden beast` number, since 1 + 1 + 6 + 501 + 20 + 1 + 136 = 666.
It is an interprime number because it is at equal distance from previous prime (116501201129) and next prime (116501201143).
It is a super-2 number, since 2×1165012011362 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 404517916 + ... + 404518203.
Almost surely, 2116501201136 is an apocalyptic number.
116501201136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
116501201136 is an abundant number, since it is smaller than the sum of its proper divisors (209540355224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116501201136 is a wasteful number, since it uses less digits than its factorization.
116501201136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 809036133 (or 809036124 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
Adding to 116501201136 its reverse (631102105611), we get a palindrome (747603306747).
The spelling of 116501201136 in words is "one hundred sixteen billion, five hundred one million, two hundred one thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •