Base | Representation |
---|---|
bin | 10000000010010100110… |
… | …111000110111001001100 |
3 | 10220100110220112201102020 |
4 | 100002110313012321030 |
5 | 121023403312230100 |
6 | 2202131143330140 |
7 | 142421545545330 |
oct | 20022467067114 |
9 | 3810426481366 |
10 | 1102009101900 |
11 | 3953a5454a93 |
12 | 1596b0750950 |
13 | 7cbc40bb475 |
14 | 3b4a22517c0 |
15 | 1d9ec0605a0 |
hex | 10094dc6e4c |
1102009101900 has 72 divisors (see below), whose sum is σ = 3643976770560. Its totient is φ = 251887794240.
The previous prime is 1102009101887. The next prime is 1102009101953. The reversal of 1102009101900 is 91019002011.
It is a super-2 number, since 2×11020091019002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 262381020 + ... + 262385219.
It is an arithmetic number, because the mean of its divisors is an integer number (50610788480).
Almost surely, 21102009101900 is an apocalyptic number.
1102009101900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102009101900 is an abundant number, since it is smaller than the sum of its proper divisors (2541967668660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102009101900 is a wasteful number, since it uses less digits than its factorization.
1102009101900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524766263 (or 524766256 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 24.
The spelling of 1102009101900 in words is "one trillion, one hundred two billion, nine million, one hundred one thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •