Base | Representation |
---|---|
bin | 10010101000001101… |
… | …111111111000011010 |
3 | 1220121222111112000000 |
4 | 102220031333320122 |
5 | 311431020023002 |
6 | 13104442353430 |
7 | 1305446065266 |
oct | 225015777032 |
9 | 56558445000 |
10 | 20002111002 |
11 | 8534741055 |
12 | 3a627bb876 |
13 | 1b69c66753 |
14 | d7a6b50a6 |
15 | 7c103661c |
hex | 4a837fe1a |
20002111002 has 56 divisors (see below), whose sum is σ = 45156079584. Its totient is φ = 6641891784.
The previous prime is 20002111001. The next prime is 20002111007. The reversal of 20002111002 is 20011120002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20002111001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 357373 + ... + 409535.
It is an arithmetic number, because the mean of its divisors is an integer number (806358564).
Almost surely, 220002111002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20002111002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22578039792).
20002111002 is an abundant number, since it is smaller than the sum of its proper divisors (25153968582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002111002 is an equidigital number, since it uses as much as digits as its factorization.
20002111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52446 (or 52431 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20002111002 its reverse (20011120002), we get a palindrome (40013231004).
The spelling of 20002111002 in words is "twenty billion, two million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •