Base | Representation |
---|---|
bin | 10011000011000000111… |
… | …000001000010001001111 |
3 | 11122010111220112222220101 |
4 | 103003000320020101033 |
5 | 132421114413404031 |
6 | 2441145250031531 |
7 | 163364624256346 |
oct | 23030070102117 |
9 | 4563456488811 |
10 | 1308905997391 |
11 | 465116348913 |
12 | 191811b785a7 |
13 | 96577253995 |
14 | 474cc2d0b5d |
15 | 240aac34361 |
hex | 130c0e0844f |
1308905997391 has 2 divisors, whose sum is σ = 1308905997392. Its totient is φ = 1308905997390.
The previous prime is 1308905997299. The next prime is 1308905997431. The reversal of 1308905997391 is 1937995098031.
It is a strong prime.
It is an emirp because it is prime and its reverse (1937995098031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1308905997391 - 217 = 1308905866319 is a prime.
It is a super-2 number, since 2×13089059973912 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1308905997991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 654452998695 + 654452998696.
It is an arithmetic number, because the mean of its divisors is an integer number (654452998696).
Almost surely, 21308905997391 is an apocalyptic number.
1308905997391 is a deficient number, since it is larger than the sum of its proper divisors (1).
1308905997391 is an equidigital number, since it uses as much as digits as its factorization.
1308905997391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16533720, while the sum is 64.
The spelling of 1308905997391 in words is "one trillion, three hundred eight billion, nine hundred five million, nine hundred ninety-seven thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •