Base | Representation |
---|---|
bin | 11010011111010111011000… |
… | …100100011001110101001010 |
3 | 120021111201210101010201020210 |
4 | 122133113120210121311022 |
5 | 110232302431024410032 |
6 | 1051441252325101550 |
7 | 33353116060523124 |
oct | 3237273044316512 |
9 | 507451711121223 |
10 | 116504621325642 |
11 | 34138372518430 |
12 | 11097461b578b6 |
13 | 5001453024c24 |
14 | 20aabd4a02214 |
15 | d70844d852cc |
hex | 69f5d8919d4a |
116504621325642 has 16 divisors (see below), whose sum is σ = 254191901074272. Its totient is φ = 35304430704720.
The previous prime is 116504621325637. The next prime is 116504621325751. The reversal of 116504621325642 is 246523126405611.
It is a junction number, because it is equal to n+sod(n) for n = 116504621325591 and 116504621325600.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 882610767553 + ... + 882610767684.
It is an arithmetic number, because the mean of its divisors is an integer number (15886993817142).
Almost surely, 2116504621325642 is an apocalyptic number.
116504621325642 is an abundant number, since it is smaller than the sum of its proper divisors (137687279748630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116504621325642 is a wasteful number, since it uses less digits than its factorization.
116504621325642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1765221535253.
The product of its (nonzero) digits is 2073600, while the sum is 48.
The spelling of 116504621325642 in words is "one hundred sixteen trillion, five hundred four billion, six hundred twenty-one million, three hundred twenty-five thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •