Base | Representation |
---|---|
bin | 110000010000011001101010… |
… | …101101001111101111110111 |
3 | 1000211110022020212202000211012 |
4 | 300100121222231033233313 |
5 | 210304212301334213143 |
6 | 2031214344534302435 |
7 | 62463231061362446 |
oct | 6020315255175767 |
9 | 1024408225660735 |
10 | 212233304210423 |
11 | 616957033525a1 |
12 | 1b9782a01b7a1b |
13 | 915668ca8a602 |
14 | 3a5a20a8c2d5d |
15 | 1980a1e193418 |
hex | c1066ab4fbf7 |
212233304210423 has 16 divisors (see below), whose sum is σ = 212766551731200. Its totient is φ = 211700731286016.
The previous prime is 212233304210419. The next prime is 212233304210449. The reversal of 212233304210423 is 324012403332212.
It is a cyclic number.
It is not a de Polignac number, because 212233304210423 - 22 = 212233304210419 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 212233304210423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212233304110423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4029235415 + ... + 4029288087.
It is an arithmetic number, because the mean of its divisors is an integer number (13297909483200).
Almost surely, 2212233304210423 is an apocalyptic number.
212233304210423 is a deficient number, since it is larger than the sum of its proper divisors (533247520777).
212233304210423 is a wasteful number, since it uses less digits than its factorization.
212233304210423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58886.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 212233304210423 its reverse (324012403332212), we get a palindrome (536245707542635).
The spelling of 212233304210423 in words is "two hundred twelve trillion, two hundred thirty-three billion, three hundred four million, two hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •