Base | Representation |
---|---|
bin | 110110010100110011… |
… | …0010001010110110101 |
3 | 102011010101011102110200 |
4 | 1230221212101112311 |
5 | 3402410433443123 |
6 | 125332131511113 |
7 | 11266664524626 |
oct | 1545146212665 |
9 | 364111142420 |
10 | 116662015413 |
11 | 45526736979 |
12 | 1a739a58499 |
13 | b002795968 |
14 | 5909cbda4d |
15 | 307bded143 |
hex | 1b299915b5 |
116662015413 has 6 divisors (see below), whose sum is σ = 168511800054. Its totient is φ = 77774676936.
The previous prime is 116662015411. The next prime is 116662015423. The reversal of 116662015413 is 314510266611.
It can be written as a sum of positive squares in only one way, i.e., 111276950724 + 5385064689 = 333582^2 + 73383^2 .
It is not a de Polignac number, because 116662015413 - 21 = 116662015411 is a prime.
It is a super-2 number, since 2×1166620154132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116662015411) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 6481223070 + ... + 6481223087.
It is an arithmetic number, because the mean of its divisors is an integer number (28085300009).
Almost surely, 2116662015413 is an apocalyptic number.
It is an amenable number.
116662015413 is a deficient number, since it is larger than the sum of its proper divisors (51849784641).
116662015413 is a wasteful number, since it uses less digits than its factorization.
116662015413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12962446163 (or 12962446160 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 116662015413 in words is "one hundred sixteen billion, six hundred sixty-two million, fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •