Base | Representation |
---|---|
bin | 1100000000011101101100… |
… | …0101110010111011000010 |
3 | 1201202002221202120000102100 |
4 | 3000013123011302323002 |
5 | 3212300410204331320 |
6 | 44024544332131230 |
7 | 2531551412251146 |
oct | 300073305627302 |
9 | 51662852500370 |
10 | 13202110230210 |
11 | 422aa90057100 |
12 | 15927a8006b16 |
13 | 749c52237a05 |
14 | 338db2497226 |
15 | 17d63cee4790 |
hex | c01db172ec2 |
13202110230210 has 144 divisors (see below), whose sum is σ = 38261073090240. Its totient is φ = 3155433758400.
The previous prime is 13202110230203. The next prime is 13202110230233. The reversal of 13202110230210 is 1203201120231.
13202110230210 is a `hidden beast` number, since 1 + 320 + 2 + 1 + 102 + 30 + 210 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 7764240 + ... + 9310619.
It is an arithmetic number, because the mean of its divisors is an integer number (265701896460).
Almost surely, 213202110230210 is an apocalyptic number.
13202110230210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13202110230210 is an abundant number, since it is smaller than the sum of its proper divisors (25058962860030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13202110230210 is a wasteful number, since it uses less digits than its factorization.
13202110230210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17074965 (or 17074951 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13202110230210 its reverse (1203201120231), we get a palindrome (14405311350441).
The spelling of 13202110230210 in words is "thirteen trillion, two hundred two billion, one hundred ten million, two hundred thirty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •