Base | Representation |
---|---|
bin | 11010011001011111011110… |
… | …111001001010101010100101 |
3 | 120020002010222100100122111120 |
4 | 122121133132321022222211 |
5 | 110204144322112143041 |
6 | 1050532021402124153 |
7 | 33312010011255516 |
oct | 3231373671125245 |
9 | 506063870318446 |
10 | 116101000506021 |
11 | 33aa2181047723 |
12 | 1103119a1b0659 |
13 | 4ca237b4c728b |
14 | 20954659d0a0d |
15 | d650c0666366 |
hex | 6997dee4aaa5 |
116101000506021 has 8 divisors (see below), whose sum is σ = 154801393850400. Its totient is φ = 77400637082832.
The previous prime is 116101000506011. The next prime is 116101000506089. The reversal of 116101000506021 is 120605000101611.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 116101000506021 - 26 = 116101000505957 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 116101000505982 and 116101000506000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116101000506011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4162255 + ... + 15796403.
It is an arithmetic number, because the mean of its divisors is an integer number (19350174231300).
Almost surely, 2116101000506021 is an apocalyptic number.
It is an amenable number.
116101000506021 is a deficient number, since it is larger than the sum of its proper divisors (38700393344379).
116101000506021 is a wasteful number, since it uses less digits than its factorization.
116101000506021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14960595.
The product of its (nonzero) digits is 360, while the sum is 24.
Adding to 116101000506021 its reverse (120605000101611), we get a palindrome (236706000607632).
The spelling of 116101000506021 in words is "one hundred sixteen trillion, one hundred one billion, five hundred six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •