Base | Representation |
---|---|
bin | 11010100010011000110000… |
… | …010110101000101000000111 |
3 | 120022020120201112220022211121 |
4 | 122202120300112220220013 |
5 | 110244203143122311242 |
6 | 1052120511342414411 |
7 | 33404116263656533 |
oct | 3242306026505007 |
9 | 508216645808747 |
10 | 116712252541447 |
11 | 3420842a971a52 |
12 | 1110b749291407 |
13 | 5017bc23550c4 |
14 | 20b6c903d0bc3 |
15 | d75e4825a667 |
hex | 6a26305a8a07 |
116712252541447 has 16 divisors (see below), whose sum is σ = 117221861207808. Its totient is φ = 116203772805120.
The previous prime is 116712252541441. The next prime is 116712252541477. The reversal of 116712252541447 is 744145252217611.
It is a cyclic number.
It is not a de Polignac number, because 116712252541447 - 23 = 116712252541439 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116712252541394 and 116712252541403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116712252541441) 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 15 ways as a sum of consecutive naturals, for example, 710750122 + ... + 710914312.
It is an arithmetic number, because the mean of its divisors is an integer number (7326366325488).
Almost surely, 2116712252541447 is an apocalyptic number.
116712252541447 is a deficient number, since it is larger than the sum of its proper divisors (509608666361).
116712252541447 is a wasteful number, since it uses less digits than its factorization.
116712252541447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167610.
The product of its digits is 3763200, while the sum is 52.
The spelling of 116712252541447 in words is "one hundred sixteen trillion, seven hundred twelve billion, two hundred fifty-two million, five hundred forty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •