Base | Representation |
---|---|
bin | 1100010110001001001… |
… | …0001001110011111110 |
3 | 202021110202221102020102 |
4 | 3011202102021303332 |
5 | 11433341143322304 |
6 | 241234412521102 |
7 | 21216044000600 |
oct | 3054222116376 |
9 | 667422842212 |
10 | 212102323454 |
11 | 81a52260a0a |
12 | 35134780192 |
13 | 1700272bc08 |
14 | a3a1537170 |
15 | 57b5ba7d1e |
hex | 3162489cfe |
212102323454 has 144 divisors (see below), whose sum is σ = 408293351136. Its totient is φ = 82104744960.
The previous prime is 212102323453. The next prime is 212102323457. The reversal of 212102323454 is 454323201212.
212102323454 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2121023234542 (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 (212102323453) 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 71 ways as a sum of consecutive naturals, for example, 219340079 + ... + 219341045.
It is an arithmetic number, because the mean of its divisors is an integer number (2835370494).
Almost surely, 2212102323454 is an apocalyptic number.
212102323454 is a deficient number, since it is larger than the sum of its proper divisors (196191027682).
212102323454 is a wasteful number, since it uses less digits than its factorization.
212102323454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1199 (or 1161 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 212102323454 its reverse (454323201212), we get a palindrome (666425524666).
The spelling of 212102323454 in words is "two hundred twelve billion, one hundred two million, three hundred twenty-three thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •