Base | Representation |
---|---|
bin | 1100000110001010110100… |
… | …0011011010000011111111 |
3 | 1202002110221101011212200121 |
4 | 3001202231003122003333 |
5 | 3220402122224144332 |
6 | 44141554114435411 |
7 | 2541621265352443 |
oct | 301425503320377 |
9 | 52073841155617 |
10 | 13300122099967 |
11 | 426860621255a |
12 | 15a979bb92b67 |
13 | 756271b97a11 |
14 | 33da2d46c823 |
15 | 180e77913797 |
hex | c18ad0da0ff |
13300122099967 has 2 divisors, whose sum is σ = 13300122099968. Its totient is φ = 13300122099966.
The previous prime is 13300122099949. The next prime is 13300122100021. The reversal of 13300122099967 is 76999022100331.
It is a happy number.
13300122099967 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (76999022100331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13300122099967 - 239 = 12750366286079 is a prime.
It is a super-3 number, since 3×133001220999673 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13300122099917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650061049983 + 6650061049984.
It is an arithmetic number, because the mean of its divisors is an integer number (6650061049984).
Almost surely, 213300122099967 is an apocalyptic number.
13300122099967 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300122099967 is an equidigital number, since it uses as much as digits as its factorization.
13300122099967 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1102248, while the sum is 52.
The spelling of 13300122099967 in words is "thirteen trillion, three hundred billion, one hundred twenty-two million, ninety-nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •