Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …101110010001001101001 |
3 | 10220100202202222120212102 |
4 | 100002123211302021221 |
5 | 121024121213013001 |
6 | 2202150255223145 |
7 | 142424416303250 |
oct | 20023345621151 |
9 | 3810682876772 |
10 | 1102122001001 |
11 | 39545315682a |
12 | 159722517ab5 |
13 | 7cc115ca278 |
14 | 3b4b323d797 |
15 | 1da06e11e6b |
hex | 1009b972269 |
1102122001001 has 8 divisors (see below), whose sum is σ = 1268629642560. Its totient is φ = 937879769808.
The previous prime is 1102122000983. The next prime is 1102122001021. The reversal of 1102122001001 is 1001002212011.
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 1102122001001 - 26 = 1102122000937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1102122001021) 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, 566351546 + ... + 566353491.
It is an arithmetic number, because the mean of its divisors is an integer number (158578705320).
Almost surely, 21102122001001 is an apocalyptic number.
It is an amenable number.
1102122001001 is a deficient number, since it is larger than the sum of its proper divisors (166507641559).
1102122001001 is a wasteful number, since it uses less digits than its factorization.
1102122001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132705183.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1102122001001 its reverse (1001002212011), we get a palindrome (2103124213012).
The spelling of 1102122001001 in words is "one trillion, one hundred two billion, one hundred twenty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •