Base | Representation |
---|---|
bin | 110110001111111111… |
… | …0010111111011000101 |
3 | 102010201010100201111000 |
4 | 1230133332113323011 |
5 | 3402043120432410 |
6 | 125304123203513 |
7 | 11262664302051 |
oct | 1543776277305 |
9 | 363633321430 |
10 | 116500561605 |
11 | 4545359127a |
12 | 1a6b3976599 |
13 | aca81b656c |
14 | 58d2692c61 |
15 | 306cb59dc0 |
hex | 1b1ff97ec5 |
116500561605 has 64 divisors (see below), whose sum is σ = 214504531200. Its totient is φ = 59920922880.
The previous prime is 116500561601. The next prime is 116500561609. The reversal of 116500561605 is 506165005611.
It is an interprime number because it is at equal distance from previous prime (116500561601) and next prime (116500561609).
It is not a de Polignac number, because 116500561605 - 22 = 116500561601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116500561605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116500561601) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3416490 + ... + 3450420.
It is an arithmetic number, because the mean of its divisors is an integer number (3351633300).
Almost surely, 2116500561605 is an apocalyptic number.
116500561605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116500561605 is a deficient number, since it is larger than the sum of its proper divisors (98003969595).
116500561605 is a wasteful number, since it uses less digits than its factorization.
116500561605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34851 (or 34845 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 116500561605 in words is "one hundred sixteen billion, five hundred million, five hundred sixty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •