Base | Representation |
---|---|
bin | 1100010101110110010… |
… | …0010100111000011000 |
3 | 202021021021001121001102 |
4 | 3011131210110320120 |
5 | 11433210414420204 |
6 | 241222505010532 |
7 | 21214063322015 |
oct | 3053544247030 |
9 | 667237047042 |
10 | 212023201304 |
11 | 81a1162a302 |
12 | 35112183a48 |
13 | 16cbc218285 |
14 | a394c1c70c |
15 | 57adc7941e |
hex | 315d914e18 |
212023201304 has 32 divisors (see below), whose sum is σ = 408960900480. Its totient is φ = 102976406784.
The previous prime is 212023201301. The next prime is 212023201307. The reversal of 212023201304 is 403102320212.
It is an interprime number because it is at equal distance from previous prime (212023201301) and next prime (212023201307).
It is a super-3 number, since 3×2120232013043 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212023201301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 410357 + ... + 769700.
It is an arithmetic number, because the mean of its divisors is an integer number (12780028140).
Almost surely, 2212023201304 is an apocalyptic number.
It is an amenable number.
212023201304 is a deficient number, since it is larger than the sum of its proper divisors (196937699176).
212023201304 is a wasteful number, since it uses less digits than its factorization.
212023201304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1180707 (or 1180703 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 212023201304 its reverse (403102320212), we get a palindrome (615125521516).
The spelling of 212023201304 in words is "two hundred twelve billion, twenty-three million, two hundred one thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •