Base | Representation |
---|---|
bin | 11000110101001101… |
… | …00110110101000011 |
3 | 1021102002001122121222 |
4 | 30122212212311003 |
5 | 204300243330034 |
6 | 10042502305255 |
7 | 651234404552 |
oct | 143246466503 |
9 | 37362048558 |
10 | 13331230019 |
11 | 572114a478 |
12 | 270072822b |
13 | 1345bb55b3 |
14 | 90674bd99 |
15 | 53057e12e |
hex | 31a9a6d43 |
13331230019 has 2 divisors, whose sum is σ = 13331230020. Its totient is φ = 13331230018.
The previous prime is 13331229979. The next prime is 13331230021. The reversal of 13331230019 is 91003213331.
13331230019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13331230019 - 212 = 13331225923 is a prime.
It is a super-2 number, since 2×133312300192 (a number of 21 digits) contains 22 as substring.
Together with 13331230021, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13331230019.
It is not a weakly prime, because it can be changed into another prime (13331230819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665615009 + 6665615010.
It is an arithmetic number, because the mean of its divisors is an integer number (6665615010).
Almost surely, 213331230019 is an apocalyptic number.
13331230019 is a deficient number, since it is larger than the sum of its proper divisors (1).
13331230019 is an equidigital number, since it uses as much as digits as its factorization.
13331230019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 26.
The spelling of 13331230019 in words is "thirteen billion, three hundred thirty-one million, two hundred thirty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •