Base | Representation |
---|---|
bin | 11110000000111101110… |
… | …00001101000010111111 |
3 | 10122120222210002102202222 |
4 | 33000132320031002333 |
5 | 113344110402413043 |
6 | 2105435524435555 |
7 | 134336554032644 |
oct | 17003670150277 |
9 | 3576883072688 |
10 | 1031310201023 |
11 | 3684157a4393 |
12 | 147a5b848bbb |
13 | 76337c2aacb |
14 | 37cb68a9dcb |
15 | 1bc603e7d68 |
hex | f01ee0d0bf |
1031310201023 has 2 divisors, whose sum is σ = 1031310201024. Its totient is φ = 1031310201022.
The previous prime is 1031310201001. The next prime is 1031310201029. The reversal of 1031310201023 is 3201020131301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1031310201023 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1031310200992 and 1031310201010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1031310201029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515655100511 + 515655100512.
It is an arithmetic number, because the mean of its divisors is an integer number (515655100512).
Almost surely, 21031310201023 is an apocalyptic number.
1031310201023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031310201023 is an equidigital number, since it uses as much as digits as its factorization.
1031310201023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1031310201023 its reverse (3201020131301), we get a palindrome (4232330332324).
The spelling of 1031310201023 in words is "one trillion, thirty-one billion, three hundred ten million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •