Base | Representation |
---|---|
bin | 101111111110111001001100… |
… | …001111010011100011011010 |
3 | 1000200012021211122001120201010 |
4 | 233332321030033103203122 |
5 | 210130004323230433310 |
6 | 2024453534143034350 |
7 | 62310300065136150 |
oct | 5776711417234332 |
9 | 1020167748046633 |
10 | 211030202202330 |
11 | 61271451662955 |
12 | 1b80309789b9b6 |
13 | 909a0a7923874 |
14 | 3a17cb83db3d0 |
15 | 195e5a6eb4320 |
hex | bfee4c3d38da |
211030202202330 has 128 divisors (see below), whose sum is σ = 605921723486208. Its totient is φ = 45990873257472.
The previous prime is 211030202202299. The next prime is 211030202202433. The reversal of 211030202202330 is 33202202030112.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 211030202202297 and 211030202202306.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 68283024 + ... + 71306603.
It is an arithmetic number, because the mean of its divisors is an integer number (4733763464736).
Almost surely, 2211030202202330 is an apocalyptic number.
211030202202330 is an abundant number, since it is smaller than the sum of its proper divisors (394891521283878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211030202202330 is a wasteful number, since it uses less digits than its factorization.
211030202202330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139589980.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 211030202202330 its reverse (33202202030112), we get a palindrome (244232404232442).
The spelling of 211030202202330 in words is "two hundred eleven trillion, thirty billion, two hundred two million, two hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •