Base | Representation |
---|---|
bin | 10000000101000111101… |
… | …111000001111011001100 |
3 | 10220122020001110112012110 |
4 | 100011013233001323030 |
5 | 121101030041343220 |
6 | 2203345025304020 |
7 | 142556115632520 |
oct | 20050757017314 |
9 | 3818201415173 |
10 | 1105010106060 |
11 | 3966a5440913 |
12 | 15a1a9795010 |
13 | 80281a64a83 |
14 | 3b6a8a39d80 |
15 | 1db25751be0 |
hex | 10147bc1ecc |
1105010106060 has 96 divisors (see below), whose sum is σ = 3541398981120. Its totient is φ = 252190407168.
The previous prime is 1105010106047. The next prime is 1105010106073. The reversal of 1105010106060 is 606010105011.
It is an interprime number because it is at equal distance from previous prime (1105010106047) and next prime (1105010106073).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1719409 + ... + 2272968.
It is an arithmetic number, because the mean of its divisors is an integer number (36889572720).
Almost surely, 21105010106060 is an apocalyptic number.
1105010106060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1105010106060 is an abundant number, since it is smaller than the sum of its proper divisors (2436388875060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105010106060 is a wasteful number, since it uses less digits than its factorization.
1105010106060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3993055 (or 3993053 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 21.
The spelling of 1105010106060 in words is "one trillion, one hundred five billion, ten million, one hundred six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •