Base | Representation |
---|---|
bin | 11101010001111010101… |
… | …100001111100100111110 |
3 | 21010100120220222200210100 |
4 | 131101322230033210332 |
5 | 230431241344104042 |
6 | 4140203012421530 |
7 | 265240535160612 |
oct | 35217254174476 |
9 | 7110526880710 |
10 | 2012103113022 |
11 | 70636782a832 |
12 | 285b613178a6 |
13 | 117981b8c602 |
14 | 6d55a06d342 |
15 | 3751581a24c |
hex | 1d47ab0f93e |
2012103113022 has 12 divisors (see below), whose sum is σ = 4359556744920. Its totient is φ = 670701037668.
The previous prime is 2012103112963. The next prime is 2012103113057. The reversal of 2012103113022 is 2203113012102.
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 111783506279 = 2012103113022 / (2 + 0 + 1 + 2 + 1 + 0 + 3 + 1 + 1 + 3 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2012103112986 and 2012103113004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55891753122 + ... + 55891753157.
It is an arithmetic number, because the mean of its divisors is an integer number (363296395410).
Almost surely, 22012103113022 is an apocalyptic number.
2012103113022 is an abundant number, since it is smaller than the sum of its proper divisors (2347453631898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012103113022 is a wasteful number, since it uses less digits than its factorization.
2012103113022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111783506287 (or 111783506284 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 2012103113022 its reverse (2203113012102), we get a palindrome (4215216125124).
The spelling of 2012103113022 in words is "two trillion, twelve billion, one hundred three million, one hundred thirteen thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •