Base | Representation |
---|---|
bin | 110011010100100001… |
… | …0001011001011110010 |
3 | 101112110201202021010201 |
4 | 1212221002023023302 |
5 | 3301202241231002 |
6 | 122344012545414 |
7 | 10651052260510 |
oct | 1465102131362 |
9 | 345421667121 |
10 | 110210102002 |
11 | 42815802930 |
12 | 1943918226a |
13 | a514bb0310 |
14 | 54970754b0 |
15 | 2d0079a087 |
hex | 19a908b2f2 |
110210102002 has 32 divisors (see below), whose sum is σ = 221961608064. Its totient is φ = 39636000000.
The previous prime is 110210101999. The next prime is 110210102021. The reversal of 110210102002 is 200201012011.
It is a self number, because there is not a number n which added to its sum of digits gives 110210102002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27522999 + ... + 27527002.
It is an arithmetic number, because the mean of its divisors is an integer number (6936300252).
Almost surely, 2110210102002 is an apocalyptic number.
110210102002 is an abundant number, since it is smaller than the sum of its proper divisors (111751506062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110210102002 is a wasteful number, since it uses less digits than its factorization.
110210102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55050034.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110210102002 its reverse (200201012011), we get a palindrome (310411114013).
It can be divided in two parts, 110210 and 102002, that added together give a palindrome (212212).
The spelling of 110210102002 in words is "one hundred ten billion, two hundred ten million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •