Base | Representation |
---|---|
bin | 11101000110110101111… |
… | …000001111101110011101 |
3 | 21002012220011021121000200 |
4 | 131012311320033232131 |
5 | 230232413032310323 |
6 | 4130515004014113 |
7 | 264340045534023 |
oct | 35066570175635 |
9 | 7065804247020 |
10 | 2000211213213 |
11 | 7013150a2464 |
12 | 2837a2831339 |
13 | 1168082464c5 |
14 | 6cb4c950713 |
15 | 3706b7ee443 |
hex | 1d1b5e0fb9d |
2000211213213 has 6 divisors (see below), whose sum is σ = 2889193974654. Its totient is φ = 1333474142136.
The previous prime is 2000211213211. The next prime is 2000211213257. The reversal of 2000211213213 is 3123121120002.
2000211213213 is a `hidden beast` number, since 200 + 0 + 21 + 121 + 321 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1994797491129 + 5413722084 = 1412373^2 + 73578^2 .
It is not a de Polignac number, because 2000211213213 - 21 = 2000211213211 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000211213211) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 111122845170 + ... + 111122845187.
It is an arithmetic number, because the mean of its divisors is an integer number (481532329109).
Almost surely, 22000211213213 is an apocalyptic number.
It is an amenable number.
2000211213213 is a deficient number, since it is larger than the sum of its proper divisors (888982761441).
2000211213213 is a wasteful number, since it uses less digits than its factorization.
2000211213213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222245690363 (or 222245690360 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2000211213213 its reverse (3123121120002), we get a palindrome (5123332333215).
The spelling of 2000211213213 in words is "two trillion, two hundred eleven million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •