Base | Representation |
---|---|
bin | 111100110011011… |
… | …010110010000010 |
3 | 2122002112001121000 |
4 | 330303122302002 |
5 | 4042122041002 |
6 | 245120312430 |
7 | 34164544320 |
oct | 7463326202 |
9 | 2562461530 |
10 | 1020112002 |
11 | 483910278 |
12 | 245772716 |
13 | 13345c590 |
14 | 996a4d10 |
15 | 5e85561c |
hex | 3ccdac82 |
1020112002 has 64 divisors (see below), whose sum is σ = 2790063360. Its totient is φ = 269039232.
The previous prime is 1020111991. The next prime is 1020112003. The reversal of 1020112002 is 2002110201.
1020112002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (1020112003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 98883 + ... + 108710.
It is an arithmetic number, because the mean of its divisors is an integer number (43594740).
Almost surely, 21020112002 is an apocalyptic number.
1020112002 is an abundant number, since it is smaller than the sum of its proper divisors (1769951358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020112002 is a wasteful number, since it uses less digits than its factorization.
1020112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207624 (or 207618 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1020112002 is about 31939.1922565365. The cubic root of 1020112002 is about 1006.6595525766.
Adding to 1020112002 its reverse (2002110201), we get a palindrome (3022222203).
The spelling of 1020112002 in words is "one billion, twenty million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •