Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …100000010100000001010 |
3 | 21002101112121221220002000 |
4 | 131020201030002200022 |
5 | 230300104430022132 |
6 | 4131413355451430 |
7 | 264432466342200 |
oct | 35104114024012 |
9 | 7071477856060 |
10 | 2002011564042 |
11 | 702059376706 |
12 | 284005756b76 |
13 | 116a3422a159 |
14 | 6cc7dab9070 |
15 | 371248c687c |
hex | 1d22130280a |
2002011564042 has 96 divisors (see below), whose sum is σ = 5207019220800. Its totient is φ = 568493958816.
The previous prime is 2002011564037. The next prime is 2002011564143. The reversal of 2002011564042 is 2404651102002.
2002011564042 is a `hidden beast` number, since 2 + 0 + 0 + 2 + 0 + 1 + 15 + 640 + 4 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2002011563997 and 2002011564015.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1889617 + ... + 2752212.
It is an arithmetic number, because the mean of its divisors is an integer number (54239783550).
Almost surely, 22002011564042 is an apocalyptic number.
2002011564042 is an abundant number, since it is smaller than the sum of its proper divisors (3205007656758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002011564042 is a wasteful number, since it uses less digits than its factorization.
2002011564042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4642017 (or 4642004 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 2002011564042 its reverse (2404651102002), we get a palindrome (4406662666044).
The spelling of 2002011564042 in words is "two trillion, two billion, eleven million, five hundred sixty-four thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •