Base | Representation |
---|---|
bin | 11101010000000100000… |
… | …100111100111000001000 |
3 | 21010011110020102121221020 |
4 | 131100010010330320020 |
5 | 230413202423220240 |
6 | 4135233323512440 |
7 | 265140322306332 |
oct | 35200404747010 |
9 | 7104406377836 |
10 | 2010113101320 |
11 | 705536495565 |
12 | 2856a6988720 |
13 | 1177258016ac |
14 | 6d40ba54452 |
15 | 3744ac7c0d0 |
hex | 1d40413ce08 |
2010113101320 has 64 divisors (see below), whose sum is σ = 6038263808640. Its totient is φ = 535325760000.
The previous prime is 2010113101307. The next prime is 2010113101369. The reversal of 2010113101320 is 231013110102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 2010113101320.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10914556 + ... + 11097195.
It is an arithmetic number, because the mean of its divisors is an integer number (94347872010).
Almost surely, 22010113101320 is an apocalyptic number.
2010113101320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010113101320 is an abundant number, since it is smaller than the sum of its proper divisors (4028150707320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010113101320 is a wasteful number, since it uses less digits than its factorization.
2010113101320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22012526 (or 22012522 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 2010113101320 its reverse (231013110102), we get a palindrome (2241126211422).
The spelling of 2010113101320 in words is "two trillion, ten billion, one hundred thirteen million, one hundred one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •