Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …010111101000010101000 |
3 | 10220100110222102221102201 |
4 | 100002110322331002220 |
5 | 121023404042010440 |
6 | 2202131221105544 |
7 | 142421560244623 |
oct | 20022472750250 |
9 | 3810428387381 |
10 | 1102010110120 |
11 | 3953a5a83527 |
12 | 1596b0b582b4 |
13 | 7cbc438234a |
14 | 3b4a2434dba |
15 | 1d9ec1ae19a |
hex | 10094ebd0a8 |
1102010110120 has 16 divisors (see below), whose sum is σ = 2479522747860. Its totient is φ = 440804044032.
The previous prime is 1102010110051. The next prime is 1102010110139. The reversal of 1102010110120 is 210110102011.
It can be written as a sum of positive squares in 2 ways, for example, as 1101899481796 + 110628324 = 1049714^2 + 10518^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1102010110097 and 1102010110106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13775126337 + ... + 13775126416.
Almost surely, 21102010110120 is an apocalyptic number.
1102010110120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102010110120 is an abundant number, since it is smaller than the sum of its proper divisors (1377512637740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102010110120 is a wasteful number, since it uses less digits than its factorization.
1102010110120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27550252764 (or 27550252760 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1102010110120 its reverse (210110102011), we get a palindrome (1312120212131).
The spelling of 1102010110120 in words is "one trillion, one hundred two billion, ten million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •