Base | Representation |
---|---|
bin | 11011110110000110000… |
… | …011000101001011100001 |
3 | 20202221002202112012102011 |
4 | 123312012003011023201 |
5 | 222322331401320223 |
6 | 4023015403152521 |
7 | 255150355355146 |
oct | 33660603051341 |
9 | 6687082465364 |
10 | 1913509401313 |
11 | 678573198964 |
12 | 26aa26515741 |
13 | 10b59b820923 |
14 | 68885aba3cd |
15 | 34b94cb880d |
hex | 1bd860c52e1 |
1913509401313 has 2 divisors, whose sum is σ = 1913509401314. Its totient is φ = 1913509401312.
The previous prime is 1913509401311. The next prime is 1913509401347. The reversal of 1913509401313 is 3131049053191.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1158501337569 + 755008063744 = 1076337^2 + 868912^2 .
It is a cyclic number.
It is not a de Polignac number, because 1913509401313 - 21 = 1913509401311 is a prime.
It is a super-2 number, since 2×19135094013132 (a number of 25 digits) contains 22 as substring.
Together with 1913509401311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1913509401311) 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, 956754700656 + 956754700657.
It is an arithmetic number, because the mean of its divisors is an integer number (956754700657).
Almost surely, 21913509401313 is an apocalyptic number.
It is an amenable number.
1913509401313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1913509401313 is an equidigital number, since it uses as much as digits as its factorization.
1913509401313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 40.
The spelling of 1913509401313 in words is "one trillion, nine hundred thirteen billion, five hundred nine million, four hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •