Base | Representation |
---|---|
bin | 110110010100100101… |
… | …1111010010000100101 |
3 | 102011002220011100020201 |
4 | 1230221023322100211 |
5 | 3402402201330221 |
6 | 125331323430501 |
7 | 11266552014055 |
oct | 1545113722045 |
9 | 364086140221 |
10 | 116655105061 |
11 | 45522847040 |
12 | 1a737685431 |
13 | b0012164b1 |
14 | 5909001565 |
15 | 307b4d5891 |
hex | 1b292fa425 |
116655105061 has 4 divisors (see below), whose sum is σ = 127260114624. Its totient is φ = 106050095500.
The previous prime is 116655105059. The next prime is 116655105067. The reversal of 116655105061 is 160501556611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 116655105061 - 21 = 116655105059 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116655105061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116655105067) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5302504765 + ... + 5302504786.
It is an arithmetic number, because the mean of its divisors is an integer number (31815028656).
Almost surely, 2116655105061 is an apocalyptic number.
116655105061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
116655105061 is a deficient number, since it is larger than the sum of its proper divisors (10605009563).
116655105061 is a wasteful number, since it uses less digits than its factorization.
116655105061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10605009562.
The product of its (nonzero) digits is 27000, while the sum is 37.
The spelling of 116655105061 in words is "one hundred sixteen billion, six hundred fifty-five million, one hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •