Base | Representation |
---|---|
bin | 110110000111011110… |
… | …1001111000110010001 |
3 | 102002222020010021001212 |
4 | 1230032331033012101 |
5 | 3401002023110031 |
6 | 125215523505505 |
7 | 11252626426424 |
oct | 1541675170621 |
9 | 362866107055 |
10 | 116215050641 |
11 | 453174036a8 |
12 | 1a634228295 |
13 | ac60cbc671 |
14 | 58a67b19bb |
15 | 3052a5e12b |
hex | 1b0ef4f191 |
116215050641 has 2 divisors, whose sum is σ = 116215050642. Its totient is φ = 116215050640.
The previous prime is 116215050583. The next prime is 116215050703. The reversal of 116215050641 is 146050512611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115355329600 + 859721041 = 339640^2 + 29321^2 .
It is an emirp because it is prime and its reverse (146050512611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116215050641 - 222 = 116210856337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116215050598 and 116215050607.
It is not a weakly prime, because it can be changed into another prime (116215050841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58107525320 + 58107525321.
It is an arithmetic number, because the mean of its divisors is an integer number (58107525321).
Almost surely, 2116215050641 is an apocalyptic number.
It is an amenable number.
116215050641 is a deficient number, since it is larger than the sum of its proper divisors (1).
116215050641 is an equidigital number, since it uses as much as digits as its factorization.
116215050641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 116215050641 in words is "one hundred sixteen billion, two hundred fifteen million, fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •