Base | Representation |
---|---|
bin | 101110110100011010110011… |
… | …000011101101101000010111 |
3 | 1000000002000201001110002121121 |
4 | 232310122303003231220113 |
5 | 203442131421001343311 |
6 | 2005534452230424411 |
7 | 61241450253654106 |
oct | 5664326303555027 |
9 | 1000060631402547 |
10 | 205912326199831 |
11 | 5a678a22020009 |
12 | 1b117231502107 |
13 | 8ab85ab715bc4 |
14 | 38bc2d184403d |
15 | 18c13baee4b71 |
hex | bb46b30eda17 |
205912326199831 has 2 divisors, whose sum is σ = 205912326199832. Its totient is φ = 205912326199830.
The previous prime is 205912326199829. The next prime is 205912326199883. The reversal of 205912326199831 is 138991623219502.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 205912326199831 - 21 = 205912326199829 is a prime.
It is a super-2 number, since 2×2059123261998312 (a number of 29 digits) contains 22 as substring.
Together with 205912326199829, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 205912326199831.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205912326199891) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102956163099915 + 102956163099916.
It is an arithmetic number, because the mean of its divisors is an integer number (102956163099916).
Almost surely, 2205912326199831 is an apocalyptic number.
205912326199831 is a deficient number, since it is larger than the sum of its proper divisors (1).
205912326199831 is an equidigital number, since it uses as much as digits as its factorization.
205912326199831 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12597120, while the sum is 61.
The spelling of 205912326199831 in words is "two hundred five trillion, nine hundred twelve billion, three hundred twenty-six million, one hundred ninety-nine thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •