Base | Representation |
---|---|
bin | 1100010010111001001… |
… | …1011000111000111010 |
3 | 202012012222221120211110 |
4 | 3010232103120320322 |
5 | 11430044414411442 |
6 | 241012100541150 |
7 | 21155324230350 |
oct | 3045623307072 |
9 | 665188846743 |
10 | 211230232122 |
11 | 81644a60878 |
12 | 34b306b17b6 |
13 | 16bc3b57640 |
14 | a31b7a37d0 |
15 | 576434069c |
hex | 312e4d8e3a |
211230232122 has 64 divisors (see below), whose sum is σ = 547317227520. Its totient is φ = 52777013184.
The previous prime is 211230232111. The next prime is 211230232127. The reversal of 211230232122 is 221232032112.
211230232122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (211230232127) 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 31 ways as a sum of consecutive naturals, for example, 10170378 + ... + 10191125.
It is an arithmetic number, because the mean of its divisors is an integer number (8551831680).
Almost surely, 2211230232122 is an apocalyptic number.
211230232122 is an abundant number, since it is smaller than the sum of its proper divisors (336086995398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211230232122 is a wasteful number, since it uses less digits than its factorization.
211230232122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20361547.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 211230232122 its reverse (221232032112), we get a palindrome (432462264234).
The spelling of 211230232122 in words is "two hundred eleven billion, two hundred thirty million, two hundred thirty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •