Base | Representation |
---|---|
bin | 11101011011100000011… |
… | …01111100111000100010 |
3 | 10120200002021020101120200 |
4 | 32231300031330320202 |
5 | 113031414201120002 |
6 | 2052312221450030 |
7 | 133025323231404 |
oct | 16556015747042 |
9 | 3520067211520 |
10 | 1011200020002 |
11 | 35a93605a777 |
12 | 143b88a10916 |
13 | 74481786603 |
14 | 36d29b02b74 |
15 | 1b484b65b1c |
hex | eb7037ce22 |
1011200020002 has 96 divisors (see below), whose sum is σ = 2263029560064. Its totient is φ = 326121811200.
The previous prime is 1011200019979. The next prime is 1011200020081. The reversal of 1011200020002 is 2000200021101.
It is a super-3 number, since 3×10112000200023 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
1011200020002 is a modest number, since divided by 20002 gives 10112 as remainder.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 49012813 + ... + 49033439.
It is an arithmetic number, because the mean of its divisors is an integer number (23573224584).
Almost surely, 21011200020002 is an apocalyptic number.
1011200020002 is an abundant number, since it is smaller than the sum of its proper divisors (1251829540062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011200020002 is a wasteful number, since it uses less digits than its factorization.
1011200020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21224 (or 21221 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 1011200020002 its reverse (2000200021101), we get a palindrome (3011400041103).
The spelling of 1011200020002 in words is "one trillion, eleven billion, two hundred million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •