Base | Representation |
---|---|
bin | 10011000100000010001… |
… | …010001001100100000011 |
3 | 11122020100020110002202102 |
4 | 103010002022021210003 |
5 | 132430340304142243 |
6 | 2441450052541015 |
7 | 163434023550416 |
oct | 23040212114403 |
9 | 4566306402672 |
10 | 1310001240323 |
11 | 465628604066 |
12 | 191a7892176b |
13 | 966c012a319 |
14 | 47593951b7d |
15 | 24121e7a9b8 |
hex | 13102289903 |
1310001240323 has 2 divisors, whose sum is σ = 1310001240324. Its totient is φ = 1310001240322.
The previous prime is 1310001240311. The next prime is 1310001240329. The reversal of 1310001240323 is 3230421000131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1310001240323 - 226 = 1309934131459 is a prime.
It is a super-2 number, since 2×13100012403232 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1310001240295 and 1310001240304.
It is not a weakly prime, because it can be changed into another prime (1310001240329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655000620161 + 655000620162.
It is an arithmetic number, because the mean of its divisors is an integer number (655000620162).
Almost surely, 21310001240323 is an apocalyptic number.
1310001240323 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310001240323 is an equidigital number, since it uses as much as digits as its factorization.
1310001240323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1310001240323 its reverse (3230421000131), we get a palindrome (4540422240454).
The spelling of 1310001240323 in words is "one trillion, three hundred ten billion, one million, two hundred forty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •