Base | Representation |
---|---|
bin | 1011110101000001100… |
… | …1110111111111000011 |
3 | 201102112020000200120000 |
4 | 2331100121313333003 |
5 | 11312134340014412 |
6 | 233204323251043 |
7 | 20452536045021 |
oct | 2752031677703 |
9 | 642466020500 |
10 | 203212423107 |
11 | 7920012a231 |
12 | 33473519a83 |
13 | 16216a1a455 |
14 | 9b9a9c1711 |
15 | 54454c84dc |
hex | 2f50677fc3 |
203212423107 has 10 divisors (see below), whose sum is σ = 303564237108. Its totient is φ = 135474948684.
The previous prime is 203212423097. The next prime is 203212423153. The reversal of 203212423107 is 701324212302.
203212423107 is a `hidden beast` number, since 2 + 0 + 321 + 24 + 2 + 310 + 7 = 666.
It is not a de Polignac number, because 203212423107 - 28 = 203212422851 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (203212423177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1254397593 + ... + 1254397754.
Almost surely, 2203212423107 is an apocalyptic number.
203212423107 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
203212423107 is a deficient number, since it is larger than the sum of its proper divisors (100351814001).
203212423107 is an equidigital number, since it uses as much as digits as its factorization.
203212423107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2508795359 (or 2508795350 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
Adding to 203212423107 its reverse (701324212302), we get a palindrome (904536635409).
The spelling of 203212423107 in words is "two hundred three billion, two hundred twelve million, four hundred twenty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •