Base | Representation |
---|---|
bin | 110110000101110111… |
… | …0110010100110011101 |
3 | 102002211110021202121010 |
4 | 1230023232302212131 |
5 | 3400344144313003 |
6 | 125210311525433 |
7 | 11251401430032 |
oct | 1541356624635 |
9 | 362743252533 |
10 | 116160932253 |
11 | 452998aa763 |
12 | 1a61a089879 |
13 | ac52a21852 |
14 | 589d525389 |
15 | 304ce1e003 |
hex | 1b0bbb299d |
116160932253 has 4 divisors (see below), whose sum is σ = 154881243008. Its totient is φ = 77440621500.
The previous prime is 116160932249. The next prime is 116160932269. The reversal of 116160932253 is 352239061611.
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, and also an emirpimes, since its reverse is a distinct semiprime: 352239061611 = 3 ⋅117413020537.
It is not a de Polignac number, because 116160932253 - 22 = 116160932249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116160932203) 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, 19360155373 + ... + 19360155378.
It is an arithmetic number, because the mean of its divisors is an integer number (38720310752).
Almost surely, 2116160932253 is an apocalyptic number.
It is an amenable number.
116160932253 is a deficient number, since it is larger than the sum of its proper divisors (38720310755).
116160932253 is an equidigital number, since it uses as much as digits as its factorization.
116160932253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38720310754.
The product of its (nonzero) digits is 58320, while the sum is 39.
Adding to 116160932253 its reverse (352239061611), we get a palindrome (468399993864).
The spelling of 116160932253 in words is "one hundred sixteen billion, one hundred sixty million, nine hundred thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •