Base | Representation |
---|---|
bin | 11010100001111110000110… |
… | …001111111101111100101001 |
3 | 120022010211211201101211001221 |
4 | 122201332012033331330221 |
5 | 110243221032442111043 |
6 | 1052055415153542041 |
7 | 33402054045505003 |
oct | 3241760617757451 |
9 | 508124751354057 |
10 | 116683628863273 |
11 | 341a728161497a |
12 | 1110609b274921 |
13 | 50152b016b124 |
14 | 20b5736a93373 |
15 | d7532039a8ed |
hex | 6a1f863fdf29 |
116683628863273 has 4 divisors (see below), whose sum is σ = 116696856808708. Its totient is φ = 116670400917840.
The previous prime is 116683628863231. The next prime is 116683628863303. The reversal of 116683628863273 is 372368826386611.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 41544689397289 + 75138939465984 = 6445517^2 + 8668272^2 .
It is a cyclic number.
It is not a de Polignac number, because 116683628863273 - 217 = 116683628732201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116683628863073) 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, 6613959486 + ... + 6613977127.
It is an arithmetic number, because the mean of its divisors is an integer number (29174214202177).
Almost surely, 2116683628863273 is an apocalyptic number.
It is an amenable number.
116683628863273 is a deficient number, since it is larger than the sum of its proper divisors (13227945435).
116683628863273 is an equidigital number, since it uses as much as digits as its factorization.
116683628863273 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13227945434.
The product of its digits is 501645312, while the sum is 70.
The spelling of 116683628863273 in words is "one hundred sixteen trillion, six hundred eighty-three billion, six hundred twenty-eight million, eight hundred sixty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •