Base | Representation |
---|---|
bin | 100000110110010… |
… | …1000111011001001 |
3 | 2211211000121222001 |
4 | 1001230220323021 |
5 | 4224132033001 |
6 | 301212231001 |
7 | 36212503210 |
oct | 10154507311 |
9 | 2754017861 |
10 | 1102221001 |
11 | 5161a1a52 |
12 | 26916b461 |
13 | 14747a89b |
14 | a655a077 |
15 | 66b74001 |
hex | 41b28ec9 |
1102221001 has 8 divisors (see below), whose sum is σ = 1266012800. Its totient is φ = 940012128.
The previous prime is 1102220947. The next prime is 1102221007. The reversal of 1102221001 is 1001222011.
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 1102221001 - 213 = 1102212809 is a prime.
It is a super-2 number, since 2×11022210012 = 2429782270090884002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1102221007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 394236 + ... + 397021.
It is an arithmetic number, because the mean of its divisors is an integer number (158251600).
Almost surely, 21102221001 is an apocalyptic number.
It is an amenable number.
1102221001 is a deficient number, since it is larger than the sum of its proper divisors (163791799).
1102221001 is an equidigital number, since it uses as much as digits as its factorization.
1102221001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 791463.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1102221001 is about 33199.7138692489. The cubic root of 1102221001 is about 1032.9744044998.
Adding to 1102221001 its reverse (1001222011), we get a palindrome (2103443012).
It can be divided in two parts, 11022 and 21001, that added together give a palindrome (32023).
The spelling of 1102221001 in words is "one billion, one hundred two million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •