Base | Representation |
---|---|
bin | 1011110101000001100… |
… | …1000100110010011010 |
3 | 201102112012122000220011 |
4 | 2331100121010302122 |
5 | 11312134311312102 |
6 | 233204314552134 |
7 | 20452534212442 |
oct | 2752031046232 |
9 | 642465560804 |
10 | 203212213402 |
11 | 791aaaa6720 |
12 | 3347343864a |
13 | 16216975b73 |
14 | 9b9a969122 |
15 | 54454862d7 |
hex | 2f50644c9a |
203212213402 has 16 divisors (see below), whose sum is σ = 332772380352. Its totient is φ = 92301603520.
The previous prime is 203212213349. The next prime is 203212213411. The reversal of 203212213402 is 204312212302.
203212213402 is digitally balanced in base 3, 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 (22).
It is an unprimeable number.
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, 3348463 + ... + 3408610.
It is an arithmetic number, because the mean of its divisors is an integer number (20798273772).
Almost surely, 2203212213402 is an apocalyptic number.
203212213402 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
203212213402 is a deficient number, since it is larger than the sum of its proper divisors (129560166950).
203212213402 is a wasteful number, since it uses less digits than its factorization.
203212213402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6758453.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 203212213402 its reverse (204312212302), we get a palindrome (407524425704).
It can be divided in two parts, 203212 and 213402, that added together give a palindrome (416614).
The spelling of 203212213402 in words is "two hundred three billion, two hundred twelve million, two hundred thirteen thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •