Base | Representation |
---|---|
bin | 1100011101010000010… |
… | …0101111011100011010 |
3 | 202110101211020001221000 |
4 | 3013110010233130122 |
5 | 12001243410111302 |
6 | 242152051125430 |
7 | 21314254654302 |
oct | 3072404573432 |
9 | 673354201830 |
10 | 214011410202 |
11 | 82841953057 |
12 | 35587ba3876 |
13 | 172480c4745 |
14 | a502cc8602 |
15 | 58785ad31c |
hex | 31d412f71a |
214011410202 has 32 divisors (see below), whose sum is σ = 477273404160. Its totient is φ = 71083262880.
The previous prime is 214011410191. The next prime is 214011410219. The reversal of 214011410202 is 202014110412.
214011410202 is a `hidden beast` number, since 2 + 1 + 40 + 11 + 410 + 202 = 666.
214011410202 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 (18).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 7036738 + ... + 7067085.
It is an arithmetic number, because the mean of its divisors is an integer number (14914793880).
Almost surely, 2214011410202 is an apocalyptic number.
214011410202 is an abundant number, since it is smaller than the sum of its proper divisors (263261993958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
214011410202 is a wasteful number, since it uses less digits than its factorization.
214011410202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14104115 (or 14104109 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 214011410202 its reverse (202014110412), we get a palindrome (416025520614).
The spelling of 214011410202 in words is "two hundred fourteen billion, eleven million, four hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •