Base | Representation |
---|---|
bin | 1011111011101100010000… |
… | …0110000000100001011011 |
3 | 1201110021022201112100210111 |
4 | 2332323010012000201123 |
5 | 3204430001212000243 |
6 | 43523144441425151 |
7 | 2522616543125344 |
oct | 276730406004133 |
9 | 51407281470714 |
10 | 13120120031323 |
11 | 41a9236798158 |
12 | 157a92579b1b7 |
13 | 7422b69aaa26 |
14 | 3350352950cb |
15 | 17b43ee4c39d |
hex | beec418085b |
13120120031323 has 2 divisors, whose sum is σ = 13120120031324. Its totient is φ = 13120120031322.
The previous prime is 13120120031321. The next prime is 13120120031387. The reversal of 13120120031323 is 32313002102131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13120120031323 - 21 = 13120120031321 is a prime.
It is a super-2 number, since 2×131201200313232 (a number of 27 digits) contains 22 as substring.
Together with 13120120031321, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 13120120031294 and 13120120031303.
It is not a weakly prime, because it can be changed into another prime (13120120031321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6560060015661 + 6560060015662.
It is an arithmetic number, because the mean of its divisors is an integer number (6560060015662).
Almost surely, 213120120031323 is an apocalyptic number.
13120120031323 is a deficient number, since it is larger than the sum of its proper divisors (1).
13120120031323 is an equidigital number, since it uses as much as digits as its factorization.
13120120031323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13120120031323 its reverse (32313002102131), we get a palindrome (45433122133454).
The spelling of 13120120031323 in words is "thirteen trillion, one hundred twenty billion, one hundred twenty million, thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •