Base | Representation |
---|---|
bin | 11101010000000100000… |
… | …000110011010000000000 |
3 | 21010011110011101100110122 |
4 | 131100010000303100000 |
5 | 230413202133411222 |
6 | 4135233244315412 |
7 | 265140310125314 |
oct | 35200400632000 |
9 | 7104404340418 |
10 | 2010112013312 |
11 | 705535912087 |
12 | 2856a6542b68 |
13 | 1177255103c0 |
14 | 6d40b84db44 |
15 | 3744ab14a42 |
hex | 1d404033400 |
2010112013312 has 88 divisors (see below), whose sum is σ = 4581909016776. Its totient is φ = 873170731008.
The previous prime is 2010112013303. The next prime is 2010112013359. The reversal of 2010112013312 is 2133102110102.
It can be written as a sum of positive squares in 4 ways, for example, as 390255087616 + 1619856925696 = 624704^2 + 1272736^2 .
It is a super-2 number, since 2×20101120133122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4214873 + ... + 4667480.
Almost surely, 22010112013312 is an apocalyptic number.
It is an amenable number.
2010112013312 is an abundant number, since it is smaller than the sum of its proper divisors (2571797003464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010112013312 is a wasteful number, since it uses less digits than its factorization.
2010112013312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8882403 (or 8882385 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2010112013312 its reverse (2133102110102), we get a palindrome (4143214123414).
The spelling of 2010112013312 in words is "two trillion, ten billion, one hundred twelve million, thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •