Base | Representation |
---|---|
bin | 1100010101110100010… |
… | …1110011100101101101 |
3 | 202021020201000010011211 |
4 | 3011131011303211231 |
5 | 11433201342404441 |
6 | 241222021314421 |
7 | 21213635320300 |
oct | 3053505634555 |
9 | 667221003154 |
10 | 212015200621 |
11 | 81a08065274 |
12 | 3510b565a11 |
13 | 16cba676743 |
14 | a393b38b37 |
15 | 57ad1e8a81 |
hex | 315d17396d |
212015200621 has 6 divisors (see below), whose sum is σ = 246629927310. Its totient is φ = 181727314776.
The previous prime is 212015200603. The next prime is 212015200667. The reversal of 212015200621 is 126002510212.
It can be written as a sum of positive squares in only one way, i.e., 207088704900 + 4926495721 = 455070^2 + 70189^2 .
It is not a de Polignac number, because 212015200621 - 223 = 212006812013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212015200592 and 212015200601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212015200601) 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, 2163420366 + ... + 2163420463.
It is an arithmetic number, because the mean of its divisors is an integer number (41104987885).
Almost surely, 2212015200621 is an apocalyptic number.
It is an amenable number.
212015200621 is a deficient number, since it is larger than the sum of its proper divisors (34614726689).
212015200621 is an equidigital number, since it uses as much as digits as its factorization.
212015200621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4326840843 (or 4326840836 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 212015200621 its reverse (126002510212), we get a palindrome (338017710833).
The spelling of 212015200621 in words is "two hundred twelve billion, fifteen million, two hundred thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •