Base | Representation |
---|---|
bin | 1100010110001101100… |
… | …1100000110110000111 |
3 | 202021112002010210211022 |
4 | 3011203121200312013 |
5 | 11433410440430043 |
6 | 241240321501355 |
7 | 21216362001650 |
oct | 3054331406607 |
9 | 667462123738 |
10 | 212121030023 |
11 | 81a61878491 |
12 | 3513aaa185b |
13 | 1700657b6a6 |
14 | a3a3c06527 |
15 | 57b7650868 |
hex | 3163660d87 |
212121030023 has 4 divisors (see below), whose sum is σ = 242424034320. Its totient is φ = 181818025728.
The previous prime is 212121030013. The next prime is 212121030029. The reversal of 212121030023 is 320030121212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212121030023 - 216 = 212120964487 is a prime.
It is a super-3 number, since 3×2121210300233 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212121029983 and 212121030010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212121030029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15151502138 + ... + 15151502151.
It is an arithmetic number, because the mean of its divisors is an integer number (60606008580).
Almost surely, 2212121030023 is an apocalyptic number.
212121030023 is a deficient number, since it is larger than the sum of its proper divisors (30303004297).
212121030023 is an equidigital number, since it uses as much as digits as its factorization.
212121030023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30303004296.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 212121030023 its reverse (320030121212), we get a palindrome (532151151235).
The spelling of 212121030023 in words is "two hundred twelve billion, one hundred twenty-one million, thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •