Base | Representation |
---|---|
bin | 101110001011111100100101… |
… | …110001100011010011111010 |
3 | 222122020010220110021120222000 |
4 | 232023330211301203103322 |
5 | 203111100004133323002 |
6 | 2000005051122241430 |
7 | 60533511214265550 |
oct | 5613744561432372 |
9 | 878203813246860 |
10 | 203131112011002 |
11 | 597a646a12750a |
12 | 1a9482064b6276 |
13 | 894624918b286 |
14 | 382385396dbd0 |
15 | 1873d8e0a161c |
hex | b8bf25c634fa |
203131112011002 has 64 divisors (see below), whose sum is σ = 528471185760000. Its totient is φ = 56621912751360.
The previous prime is 203131112011001. The next prime is 203131112011019. The reversal of 203131112011002 is 200110211131302.
203131112011002 is a `hidden beast` number, since 20 + 31 + 311 + 1 + 201 + 100 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (203131112011001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6553446627 + ... + 6553477622.
It is an arithmetic number, because the mean of its divisors is an integer number (8257362277500).
Almost surely, 2203131112011002 is an apocalyptic number.
203131112011002 is an abundant number, since it is smaller than the sum of its proper divisors (325340073748998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203131112011002 is a wasteful number, since it uses less digits than its factorization.
203131112011002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13106924308 (or 13106924302 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 203131112011002 its reverse (200110211131302), we get a palindrome (403241323142304).
The spelling of 203131112011002 in words is "two hundred three trillion, one hundred thirty-one billion, one hundred twelve million, eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •