Base | Representation |
---|---|
bin | 10011000100010101010… |
… | …101101110000010010001 |
3 | 11122021011122222020110211 |
4 | 103010111111232002101 |
5 | 132432020144243101 |
6 | 2441542030124121 |
7 | 163445012034154 |
oct | 23042525560221 |
9 | 4567148866424 |
10 | 1310323040401 |
11 | 465783218241 |
12 | 191b48650641 |
13 | 967419bb97b |
14 | 475c459bc9b |
15 | 24140343c51 |
hex | 1311556e091 |
1310323040401 has 4 divisors (see below), whose sum is σ = 1310339575792. Its totient is φ = 1310306505012.
The previous prime is 1310323040387. The next prime is 1310323040413. The reversal of 1310323040401 is 1040403230131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1310323040401 - 215 = 1310323007633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310323040501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8148255 + ... + 8307508.
It is an arithmetic number, because the mean of its divisors is an integer number (327584893948).
Almost surely, 21310323040401 is an apocalyptic number.
It is an amenable number.
1310323040401 is a deficient number, since it is larger than the sum of its proper divisors (16535391).
1310323040401 is an equidigital number, since it uses as much as digits as its factorization.
1310323040401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16535390.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1310323040401 its reverse (1040403230131), we get a palindrome (2350726270532).
The spelling of 1310323040401 in words is "one trillion, three hundred ten billion, three hundred twenty-three million, forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •