Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …011101000110000101010011 |
3 | 222020212220112210001120200010 |
4 | 231201130102131012011103 |
5 | 202220221002242320034 |
6 | 1545451144545530003 |
7 | 60112465435000341 |
oct | 5541342235060523 |
9 | 866786483046603 |
10 | 200210210120019 |
11 | 5887a745163870 |
12 | 1a5560b6343903 |
13 | 8793984986b98 |
14 | 3762323b22991 |
15 | 1822dd8a793e9 |
hex | b61712746153 |
200210210120019 has 32 divisors (see below), whose sum is σ = 309577017404160. Its totient is φ = 113815079856000.
The previous prime is 200210210119939. The next prime is 200210210120023. The reversal of 200210210120019 is 910021012012002.
It is not a de Polignac number, because 200210210120019 - 216 = 200210210054483 is a prime.
It is a super-2 number, since 2×2002102101200192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200210210119977 and 200210210120004.
It is not an unprimeable number, because it can be changed into a prime (200210210120029) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1580701672 + ... + 1580828325.
It is an arithmetic number, because the mean of its divisors is an integer number (9674281793880).
Almost surely, 2200210210120019 is an apocalyptic number.
200210210120019 is a deficient number, since it is larger than the sum of its proper divisors (109366807284141).
200210210120019 is a wasteful number, since it uses less digits than its factorization.
200210210120019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3161530131.
The product of its (nonzero) digits is 144, while the sum is 21.
It can be divided in two parts, 2002102 and 10120019, that added together give a palindrome (12122121).
The spelling of 200210210120019 in words is "two hundred trillion, two hundred ten billion, two hundred ten million, one hundred twenty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •