Base | Representation |
---|---|
bin | 1100000000111011011101… |
… | …1101001100110001011111 |
3 | 1201202212120202002020212011 |
4 | 3000032313131030301133 |
5 | 3212413242143221343 |
6 | 44032345350252051 |
7 | 2532253436015134 |
oct | 300166735146137 |
9 | 51685522066764 |
10 | 13210102320223 |
11 | 4233411411676 |
12 | 1594258657027 |
13 | 74a926c3b663 |
14 | 33952daa258b |
15 | 17d95997b29d |
hex | c03b774cc5f |
13210102320223 has 16 divisors (see below), whose sum is σ = 13398607281024. Its totient is φ = 13022856271840.
The previous prime is 13210102320209. The next prime is 13210102320253. The reversal of 13210102320223 is 32202320101231.
It is not a de Polignac number, because 13210102320223 - 213 = 13210102312031 is a prime.
It is a super-2 number, since 2×132101023202232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13210102320194 and 13210102320203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210102320253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51875736 + ... + 52129762.
It is an arithmetic number, because the mean of its divisors is an integer number (837412955064).
Almost surely, 213210102320223 is an apocalyptic number.
13210102320223 is a deficient number, since it is larger than the sum of its proper divisors (188504960801).
13210102320223 is a wasteful number, since it uses less digits than its factorization.
13210102320223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256502.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 13210102320223 its reverse (32202320101231), we get a palindrome (45412422421454).
The spelling of 13210102320223 in words is "thirteen trillion, two hundred ten billion, one hundred two million, three hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •