Base | Representation |
---|---|
bin | 10000000010011010011… |
… | …001111100101100000100 |
3 | 10220100201101120120221020 |
4 | 100002122121330230010 |
5 | 121024101120334340 |
6 | 2202144305151140 |
7 | 142424055314562 |
oct | 20023231745404 |
9 | 3810641516836 |
10 | 1102102121220 |
11 | 395442a08861 |
12 | 15971792b4b0 |
13 | 7cc0a459799 |
14 | 3b4b0746a32 |
15 | 1da052d69d0 |
hex | 1009a67cb04 |
1102102121220 has 24 divisors (see below), whose sum is σ = 3085885939584. Its totient is φ = 293893898976.
The previous prime is 1102102121201. The next prime is 1102102121233. The reversal of 1102102121220 is 221212012011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1102102121220.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9184184284 + ... + 9184184403.
It is an arithmetic number, because the mean of its divisors is an integer number (128578580816).
Almost surely, 21102102121220 is an apocalyptic number.
1102102121220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102102121220 is an abundant number, since it is smaller than the sum of its proper divisors (1983783818364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102102121220 is a wasteful number, since it uses less digits than its factorization.
1102102121220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18368368699 (or 18368368697 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1102102121220 its reverse (221212012011), we get a palindrome (1323314133231).
The spelling of 1102102121220 in words is "one trillion, one hundred two billion, one hundred two million, one hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •