Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …000110011100000110101 |
3 | 10220100201221210112210102 |
4 | 100002122320303200311 |
5 | 121024110203210401 |
6 | 2202145154403445 |
7 | 142424214134405 |
oct | 20023270634065 |
9 | 3810657715712 |
10 | 1102110210101 |
11 | 39544753308a |
12 | 15971a590585 |
13 | 7cc0c02c4c4 |
14 | 3b4b1850805 |
15 | 1da05d8356b |
hex | 1009ae33835 |
1102110210101 has 8 divisors (see below), whose sum is σ = 1102608840960. Its totient is φ = 1101611666992.
The previous prime is 1102110210079. The next prime is 1102110210133. The reversal of 1102110210101 is 1010120112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1102110210101 - 222 = 1102106015797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102110210191) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 41090171 + ... + 41116983.
It is an arithmetic number, because the mean of its divisors is an integer number (137826105120).
Almost surely, 21102110210101 is an apocalyptic number.
It is an amenable number.
1102110210101 is a deficient number, since it is larger than the sum of its proper divisors (498630859).
1102110210101 is a wasteful number, since it uses less digits than its factorization.
1102110210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43875.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1102110210101 its reverse (1010120112011), we get a palindrome (2112230322112).
The spelling of 1102110210101 in words is "one trillion, one hundred two billion, one hundred ten million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •