Base | Representation |
---|---|
bin | 1100010110001101100… |
… | …1100000110101111010 |
3 | 202021112002010210210211 |
4 | 3011203121200311322 |
5 | 11433410440430020 |
6 | 241240321501334 |
7 | 21216362001631 |
oct | 3054331406572 |
9 | 667462123724 |
10 | 212121030010 |
11 | 81a6187847a |
12 | 3513aaa184a |
13 | 1700657b696 |
14 | a3a3c06518 |
15 | 57b765085a |
hex | 3163660d7a |
212121030010 has 8 divisors (see below), whose sum is σ = 381817854036. Its totient is φ = 84848412000.
The previous prime is 212121029969. The next prime is 212121030013. The reversal of 212121030010 is 10030121212.
212121030010 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 186725101689 + 25395928321 = 432117^2 + 159361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2121210300103 (a number of 35 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (212121030013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10606051491 + ... + 10606051510.
Almost surely, 2212121030010 is an apocalyptic number.
212121030010 is a deficient number, since it is larger than the sum of its proper divisors (169696824026).
212121030010 is a wasteful number, since it uses less digits than its factorization.
212121030010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21212103008.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 212121030010 its reverse (10030121212), we get a palindrome (222151151222).
The spelling of 212121030010 in words is "two hundred twelve billion, one hundred twenty-one million, thirty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •