Base | Representation |
---|---|
bin | 101101011110010011100000… |
… | …111100010110000111000011 |
3 | 222020010022002201001222212102 |
4 | 231132103200330112013003 |
5 | 202203203001024232111 |
6 | 1545204133135021015 |
7 | 60061064253310541 |
oct | 5536234074260703 |
9 | 866108081058772 |
10 | 199994631086531 |
11 | 587a7279443186 |
12 | 1a52037136a76b |
13 | 8779549b843c8 |
14 | 3755b12970d91 |
15 | 181c4bca6513b |
hex | b5e4e0f161c3 |
199994631086531 has 2 divisors, whose sum is σ = 199994631086532. Its totient is φ = 199994631086530.
The previous prime is 199994631086527. The next prime is 199994631086533. The reversal of 199994631086531 is 135680136499991.
199994631086531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 199994631086531 - 22 = 199994631086527 is a prime.
It is a super-2 number, since 2×1999946310865312 (a number of 29 digits) contains 22 as substring.
Together with 199994631086533, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (199994631086533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 99997315543265 + 99997315543266.
It is an arithmetic number, because the mean of its divisors is an integer number (99997315543266).
Almost surely, 2199994631086531 is an apocalyptic number.
199994631086531 is a deficient number, since it is larger than the sum of its proper divisors (1).
199994631086531 is an equidigital number, since it uses as much as digits as its factorization.
199994631086531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340122240, while the sum is 74.
The spelling of 199994631086531 in words is "one hundred ninety-nine trillion, nine hundred ninety-four billion, six hundred thirty-one million, eighty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •