Base | Representation |
---|---|
bin | 10011000100000010001… |
… | …001001111001111001111 |
3 | 11122020100012222222001021 |
4 | 103010002021033033033 |
5 | 132430340224021143 |
6 | 2441450043455011 |
7 | 163434021534052 |
oct | 23040211171717 |
9 | 4566305888037 |
10 | 1310001001423 |
11 | 465628460624 |
12 | 191a78827467 |
13 | 966c007566a |
14 | 475938cca99 |
15 | 24121e2eced |
hex | 1310224f3cf |
1310001001423 has 2 divisors, whose sum is σ = 1310001001424. Its totient is φ = 1310001001422.
The previous prime is 1310001001363. The next prime is 1310001001453. The reversal of 1310001001423 is 3241001000131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1310001001423 is a prime.
It is a super-2 number, since 2×13100010014232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1310001001397 and 1310001001406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310001001453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655000500711 + 655000500712.
It is an arithmetic number, because the mean of its divisors is an integer number (655000500712).
Almost surely, 21310001001423 is an apocalyptic number.
1310001001423 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310001001423 is an equidigital number, since it uses as much as digits as its factorization.
1310001001423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 1310001001423 its reverse (3241001000131), we get a palindrome (4551002001554).
The spelling of 1310001001423 in words is "one trillion, three hundred ten billion, one million, one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •