Base | Representation |
---|---|
bin | 1011101100110101000… |
… | …0000010111010001001 |
3 | 201012211212121012012020 |
4 | 2323031100002322021 |
5 | 11243133034443423 |
6 | 232202121235053 |
7 | 20344160034015 |
oct | 2731520027211 |
9 | 635755535166 |
10 | 201012031113 |
11 | 78281062153 |
12 | 32b5a632a89 |
13 | 15c55bac55a |
14 | 9a2c681545 |
15 | 53672304e3 |
hex | 2ecd402e89 |
201012031113 has 8 divisors (see below), whose sum is σ = 268637890176. Its totient is φ = 133697096400.
The previous prime is 201012031067. The next prime is 201012031151. The reversal of 201012031113 is 311130210102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201012031113 - 212 = 201012027017 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 201012031092 and 201012031101.
It is not an unprimeable number, because it can be changed into a prime (201012039113) by changing a digit.
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, 77729578 + ... + 77732163.
It is an arithmetic number, because the mean of its divisors is an integer number (33579736272).
Almost surely, 2201012031113 is an apocalyptic number.
It is an amenable number.
201012031113 is a deficient number, since it is larger than the sum of its proper divisors (67625859063).
201012031113 is a wasteful number, since it uses less digits than its factorization.
201012031113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155462175.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 201012031113 its reverse (311130210102), we get a palindrome (512142241215).
The spelling of 201012031113 in words is "two hundred one billion, twelve million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •