Base | Representation |
---|---|
bin | 100000110110001… |
… | …0000010001000010 |
3 | 2211210211111102100 |
4 | 1001230100101002 |
5 | 4224120320002 |
6 | 301210131230 |
7 | 36211602564 |
oct | 10154202102 |
9 | 2753744370 |
10 | 1102120002 |
11 | 516133085 |
12 | 269120b16 |
13 | 147443919 |
14 | a6531334 |
15 | 66b5411c |
hex | 41b10442 |
1102120002 has 48 divisors (see below), whose sum is σ = 2476656000. Its totient is φ = 353788512.
The previous prime is 1102119961. The next prime is 1102120039. The reversal of 1102120002 is 2000212011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 216199 + ... + 221237.
It is an arithmetic number, because the mean of its divisors is an integer number (51597000).
Almost surely, 21102120002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1102120002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1238328000).
1102120002 is an abundant number, since it is smaller than the sum of its proper divisors (1374535998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102120002 is a wasteful number, since it uses less digits than its factorization.
1102120002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5495 (or 5492 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1102120002 is about 33198.1927520159. The cubic root of 1102120002 is about 1032.9428522767.
Adding to 1102120002 its reverse (2000212011), we get a palindrome (3102332013).
It can be divided in two parts, 1102 and 120002, that added together give a square (121104 = 3482).
The spelling of 1102120002 in words is "one billion, one hundred two million, one hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •