Base | Representation |
---|---|
bin | 1100010111010101111… |
… | …0011110010000000011 |
3 | 202022022012211112110112 |
4 | 3011311132132100003 |
5 | 11440021111220003 |
6 | 241330354221535 |
7 | 21230033633210 |
oct | 3056536362003 |
9 | 668265745415 |
10 | 212424320003 |
11 | 820a7a99765 |
12 | 352045848ab |
13 | 1705435bb0c |
14 | a3d21d4b07 |
15 | 57d40ae3d8 |
hex | 317579e403 |
212424320003 has 8 divisors (see below), whose sum is σ = 243673146720. Its totient is φ = 181401117120.
The previous prime is 212424319967. The next prime is 212424320027. The reversal of 212424320003 is 300023424212.
212424320003 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 cyclic number.
It is not a de Polignac number, because 212424320003 - 220 = 212423271427 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212424320203) 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 7 ways as a sum of consecutive naturals, for example, 56403938 + ... + 56407703.
It is an arithmetic number, because the mean of its divisors is an integer number (30459143340).
Almost surely, 2212424320003 is an apocalyptic number.
212424320003 is a deficient number, since it is larger than the sum of its proper divisors (31248826717).
212424320003 is a wasteful number, since it uses less digits than its factorization.
212424320003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112811917.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 212424320003 its reverse (300023424212), we get a palindrome (512447744215).
The spelling of 212424320003 in words is "two hundred twelve billion, four hundred twenty-four million, three hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •