Base | Representation |
---|---|
bin | 10100001100100110000… |
… | …111101001101001110001 |
3 | 11220200110010000011222101 |
4 | 110030212013221221301 |
5 | 140214421434221213 |
6 | 2541333205140401 |
7 | 202162542101515 |
oct | 24144607515161 |
9 | 4820403004871 |
10 | 1387913976433 |
11 | 49567a290966 |
12 | 1a4ba16ba701 |
13 | a0b589b333a |
14 | 4b2653d8145 |
15 | 2618209abdd |
hex | 143261e9a71 |
1387913976433 has 2 divisors, whose sum is σ = 1387913976434. Its totient is φ = 1387913976432.
The previous prime is 1387913976431. The next prime is 1387913976443. The reversal of 1387913976433 is 3346793197831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1301990538304 + 85923438129 = 1141048^2 + 293127^2 .
It is an emirp because it is prime and its reverse (3346793197831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1387913976433 - 21 = 1387913976431 is a prime.
Together with 1387913976431, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1387913976431) 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, 693956988216 + 693956988217.
It is an arithmetic number, because the mean of its divisors is an integer number (693956988217).
Almost surely, 21387913976433 is an apocalyptic number.
It is an amenable number.
1387913976433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1387913976433 is an equidigital number, since it uses as much as digits as its factorization.
1387913976433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 61725888, while the sum is 64.
The spelling of 1387913976433 in words is "one trillion, three hundred eighty-seven billion, nine hundred thirteen million, nine hundred seventy-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •