Base | Representation |
---|---|
bin | 110110000111011110… |
… | …1001111100101100001 |
3 | 102002222020010100210221 |
4 | 1230032331033211201 |
5 | 3401002023141031 |
6 | 125215523523041 |
7 | 11252626435312 |
oct | 1541675174541 |
9 | 362866110727 |
10 | 116215052641 |
11 | 45317405156 |
12 | 1a634229481 |
13 | ac60cc054c |
14 | 58a67b2609 |
15 | 3052a5ea11 |
hex | 1b0ef4f961 |
116215052641 has 4 divisors (see below), whose sum is σ = 116277168384. Its totient is φ = 116152936900.
The previous prime is 116215052633. The next prime is 116215052659. The reversal of 116215052641 is 146250512611.
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.
It is a cyclic number.
It is not a de Polignac number, because 116215052641 - 23 = 116215052633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116215052597 and 116215052606.
It is not an unprimeable number, because it can be changed into a prime (116215050641) 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, 31055065 + ... + 31058806.
It is an arithmetic number, because the mean of its divisors is an integer number (29069292096).
Almost surely, 2116215052641 is an apocalyptic number.
It is an amenable number.
116215052641 is a deficient number, since it is larger than the sum of its proper divisors (62115743).
116215052641 is an equidigital number, since it uses as much as digits as its factorization.
116215052641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62115742.
The product of its (nonzero) digits is 14400, while the sum is 34.
The spelling of 116215052641 in words is "one hundred sixteen billion, two hundred fifteen million, fifty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •