Base | Representation |
---|---|
bin | 1100000001000110010000… |
… | …1011110001011011000101 |
3 | 1201210011001200222022110111 |
4 | 3000101210023301123011 |
5 | 3212440211023210432 |
6 | 44033545110153021 |
7 | 2532415314456541 |
oct | 300214413613305 |
9 | 51704050868414 |
10 | 13213000210117 |
11 | 423466917a1a4 |
12 | 1594927052771 |
13 | 74ac99420ac6 |
14 | 3397268c8a21 |
15 | 17da790a0347 |
hex | c04642f16c5 |
13213000210117 has 2 divisors, whose sum is σ = 13213000210118. Its totient is φ = 13213000210116.
The previous prime is 13213000210073. The next prime is 13213000210183. The reversal of 13213000210117 is 71101200031231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12486336027201 + 726664182916 = 3533601^2 + 852446^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13213000210117 is a prime.
It is a super-2 number, since 2×132130002101172 (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 (13213000210717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606500105058 + 6606500105059.
It is an arithmetic number, because the mean of its divisors is an integer number (6606500105059).
Almost surely, 213213000210117 is an apocalyptic number.
It is an amenable number.
13213000210117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13213000210117 is an equidigital number, since it uses as much as digits as its factorization.
13213000210117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 22.
Adding to 13213000210117 its reverse (71101200031231), we get a palindrome (84314200241348).
The spelling of 13213000210117 in words is "thirteen trillion, two hundred thirteen billion, two hundred ten thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •