Base | Representation |
---|---|
bin | 10111111110010… |
… | …11110111000111 |
3 | 112000102121012210 |
4 | 23333023313013 |
5 | 402441104111 |
6 | 31542314503 |
7 | 4661301240 |
oct | 1377136707 |
9 | 460377183 |
10 | 201113031 |
11 | a3583219 |
12 | 57428a33 |
13 | 32886ac2 |
14 | 1c9d1cc7 |
15 | 129c90a6 |
hex | bfcbdc7 |
201113031 has 8 divisors (see below), whose sum is σ = 306457984. Its totient is φ = 114921720.
The previous prime is 201112991. The next prime is 201113069. The reversal of 201113031 is 130311102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201113031 - 214 = 201096647 is a prime.
It is a super-2 number, since 2×2011130312 = 80892902476013922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201112998 and 201113016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201113131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4788385 + ... + 4788426.
It is an arithmetic number, because the mean of its divisors is an integer number (38307248).
Almost surely, 2201113031 is an apocalyptic number.
201113031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201113031 is a deficient number, since it is larger than the sum of its proper divisors (105344953).
201113031 is an equidigital number, since it uses as much as digits as its factorization.
201113031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9576821.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 201113031 is about 14181.4326145140. The cubic root of 201113031 is about 585.8863822015.
Adding to 201113031 its reverse (130311102), we get a palindrome (331424133).
The spelling of 201113031 in words is "two hundred one million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •