Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …000000101000001000010 |
3 | 10220020220100122120122102 |
4 | 100001121120011001002 |
5 | 121014332321041002 |
6 | 2201444133110402 |
7 | 142355040015644 |
oct | 20013130050102 |
9 | 3806810576572 |
10 | 1101011112002 |
11 | 394a3308444a |
12 | 159472488402 |
13 | 7ca954061b9 |
14 | 3b4098a8894 |
15 | 1d98e629a02 |
hex | 10059605042 |
1101011112002 has 4 divisors (see below), whose sum is σ = 1651516668006. Its totient is φ = 550505556000.
The previous prime is 1101011111947. The next prime is 1101011112011. The reversal of 1101011112002 is 2002111101011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 760329936961 + 340681175041 = 871969^2 + 583679^2 .
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 as a sum of consecutive naturals, namely, 275252777999 + ... + 275252778002.
Almost surely, 21101011112002 is an apocalyptic number.
1101011112002 is a deficient number, since it is larger than the sum of its proper divisors (550505556004).
1101011112002 is an equidigital number, since it uses as much as digits as its factorization.
1101011112002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550505556003.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101011112002 its reverse (2002111101011), we get a palindrome (3103122213013).
The spelling of 1101011112002 in words is "one trillion, one hundred one billion, eleven million, one hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •