Base | Representation |
---|---|
bin | 100000110010001… |
… | …0000000011111010 |
3 | 2211122212220111221 |
4 | 1001210100003322 |
5 | 4223101201020 |
6 | 301053142254 |
7 | 36155014153 |
oct | 10144200372 |
9 | 2748786457 |
10 | 1100022010 |
11 | 514a2a8aa |
12 | 26848a98a |
13 | 146b8a9c9 |
14 | a614692a |
15 | 6688c6aa |
hex | 419100fa |
1100022010 has 8 divisors (see below), whose sum is σ = 1980039636. Its totient is φ = 440008800.
The previous prime is 1100021999. The next prime is 1100022029. The reversal of 1100022010 is 102200011.
1100022010 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 1099121409 + 900601 = 33153^2 + 949^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1100021984 and 1100022002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55001091 + ... + 55001110.
Almost surely, 21100022010 is an apocalyptic number.
1100022010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1100022010 is a deficient number, since it is larger than the sum of its proper divisors (880017626).
1100022010 is a wasteful number, since it uses less digits than its factorization.
1100022010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110002208.
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 1100022010 is about 33166.5797151289. The cubic root of 1100022010 is about 1032.2870004060.
Adding to 1100022010 its reverse (102200011), we get a palindrome (1202222021).
The spelling of 1100022010 in words is "one billion, one hundred million, twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •