Base | Representation |
---|---|
bin | 1100010110001011110… |
… | …0100001011100011110 |
3 | 202021111112211200222011 |
4 | 3011202330201130132 |
5 | 11433402014232202 |
6 | 241235450541434 |
7 | 21216240260224 |
oct | 3054274413436 |
9 | 667445750864 |
10 | 212113430302 |
11 | 81a58557724 |
12 | 3513843787a |
13 | 17004b1a507 |
14 | a3a2bc8b14 |
15 | 57b6b4dbd7 |
hex | 3162f2171e |
212113430302 has 8 divisors (see below), whose sum is σ = 336886036416. Its totient is φ = 99818084832.
The previous prime is 212113430261. The next prime is 212113430303. The reversal of 212113430302 is 203034311212.
212113430302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2121134303022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212113430303) 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, 3119315118 + ... + 3119315185.
It is an arithmetic number, because the mean of its divisors is an integer number (42110754552).
Almost surely, 2212113430302 is an apocalyptic number.
212113430302 is a deficient number, since it is larger than the sum of its proper divisors (124772606114).
212113430302 is a wasteful number, since it uses less digits than its factorization.
212113430302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6238630322.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 212113430302 its reverse (203034311212), we get a palindrome (415147741514).
The spelling of 212113430302 in words is "two hundred twelve billion, one hundred thirteen million, four hundred thirty thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •