Base | Representation |
---|---|
bin | 1011111011101111100111… |
… | …0100001010011100001011 |
3 | 1201110100122112110201120102 |
4 | 2332323321310022130023 |
5 | 3204433322424314034 |
6 | 43523414115320015 |
7 | 2522651066024051 |
oct | 276737164123413 |
9 | 51410575421512 |
10 | 13121021323019 |
11 | 41a9659521a25 |
12 | 157ab375b000b |
13 | 7423cb63731c |
14 | 3350bcc6a1d1 |
15 | 17b49413197e |
hex | beef9d0a70b |
13121021323019 has 4 divisors (see below), whose sum is σ = 13892846106744. Its totient is φ = 12349196539296.
The previous prime is 13121021323013. The next prime is 13121021323037. The reversal of 13121021323019 is 91032312012131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13121021323019 - 220 = 13121020274443 is a prime.
It is a super-2 number, since 2×131210213230192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13121021322982 and 13121021323000.
It is not an unprimeable number, because it can be changed into a prime (13121021323013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 385912391837 + ... + 385912391870.
It is an arithmetic number, because the mean of its divisors is an integer number (3473211526686).
Almost surely, 213121021323019 is an apocalyptic number.
13121021323019 is a deficient number, since it is larger than the sum of its proper divisors (771824783725).
13121021323019 is an equidigital number, since it uses as much as digits as its factorization.
13121021323019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 771824783724.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 13121021323019 in words is "thirteen trillion, one hundred twenty-one billion, twenty-one million, three hundred twenty-three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •