Base | Representation |
---|---|
bin | 1011110101000001100… |
… | …0010011110111100111 |
3 | 201102112012020212001000 |
4 | 2331100120103313213 |
5 | 11312134233404111 |
6 | 233204310404343 |
7 | 20452532416326 |
oct | 2752030236747 |
9 | 642465225030 |
10 | 203212013031 |
11 | 791aa97a125 |
12 | 334733606b3 |
13 | 162169058c1 |
14 | 9b9a9160bd |
15 | 5445446c56 |
hex | 2f50613de7 |
203212013031 has 16 divisors (see below), whose sum is σ = 302631045120. Its totient is φ = 134765380440.
The previous prime is 203212013027. The next prime is 203212013167. The reversal of 203212013031 is 130310212302.
203212013031 is a `hidden beast` number, since 20 + 321 + 20 + 1 + 303 + 1 = 666.
It is not a de Polignac number, because 203212013031 - 22 = 203212013027 is a prime.
It is a super-2 number, since 2×2032120130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 203212012995 and 203212013013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (203212013021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19697385 + ... + 19707698.
It is an arithmetic number, because the mean of its divisors is an integer number (18914440320).
Almost surely, 2203212013031 is an apocalyptic number.
203212013031 is a deficient number, since it is larger than the sum of its proper divisors (99419032089).
203212013031 is a wasteful number, since it uses less digits than its factorization.
203212013031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39405283 (or 39405277 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 203212013031 its reverse (130310212302), we get a palindrome (333522225333).
The spelling of 203212013031 in words is "two hundred three billion, two hundred twelve million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •