Base | Representation |
---|---|
bin | 1100001110101100010… |
… | …0000001101000001101 |
3 | 202002022101020010022022 |
4 | 3003223010001220031 |
5 | 11420242121144323 |
6 | 240304121455525 |
7 | 21115345435412 |
oct | 3035304015015 |
9 | 662271203268 |
10 | 210102131213 |
11 | 811161a2977 |
12 | 348769415a5 |
13 | 16a74218200 |
14 | a251a2c109 |
15 | 56ea2a84c8 |
hex | 30eb101a0d |
210102131213 has 12 divisors (see below), whose sum is σ = 231236676468. Its totient is φ = 190761068160.
The previous prime is 210102131179. The next prime is 210102131219. The reversal of 210102131213 is 312131201012.
It can be written as a sum of positive squares in 6 ways, for example, as 160639036804 + 49463094409 = 400798^2 + 222403^2 .
It is not a de Polignac number, because 210102131213 - 214 = 210102114829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210102131191 and 210102131200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210102131219) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10179920 + ... + 10200537.
It is an arithmetic number, because the mean of its divisors is an integer number (19269723039).
Almost surely, 2210102131213 is an apocalyptic number.
It is an amenable number.
210102131213 is a deficient number, since it is larger than the sum of its proper divisors (21134545255).
210102131213 is a wasteful number, since it uses less digits than its factorization.
210102131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20380544 (or 20380531 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 210102131213 its reverse (312131201012), we get a palindrome (522233332225).
The spelling of 210102131213 in words is "two hundred ten billion, one hundred two million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •