Base | Representation |
---|---|
bin | 1011110101111100001111… |
… | …1011011110101010011101 |
3 | 1201002211100002100101211212 |
4 | 2331133003323132222131 |
5 | 3201320142223222024 |
6 | 43405530125154205 |
7 | 2512521525326015 |
oct | 275370373365235 |
9 | 51084302311755 |
10 | 13021333023389 |
11 | 4170353031a39 |
12 | 15637560bb965 |
13 | 735ba2591192 |
14 | 330343386c45 |
15 | 178aac467a0e |
hex | bd7c3edea9d |
13021333023389 has 2 divisors, whose sum is σ = 13021333023390. Its totient is φ = 13021333023388.
The previous prime is 13021333023319. The next prime is 13021333023397. The reversal of 13021333023389 is 98332033312031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10430897496100 + 2590435527289 = 3229690^2 + 1609483^2 .
It is a cyclic number.
It is not a de Polignac number, because 13021333023389 - 224 = 13021316246173 is a prime.
It is a super-2 number, since 2×130213330233892 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13021333023319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6510666511694 + 6510666511695.
It is an arithmetic number, because the mean of its divisors is an integer number (6510666511695).
Almost surely, 213021333023389 is an apocalyptic number.
It is an amenable number.
13021333023389 is a deficient number, since it is larger than the sum of its proper divisors (1).
13021333023389 is an equidigital number, since it uses as much as digits as its factorization.
13021333023389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 41.
The spelling of 13021333023389 in words is "thirteen trillion, twenty-one billion, three hundred thirty-three million, twenty-three thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •