Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …100011111101100101001 |
3 | 10221010102012000020122001 |
4 | 100021320110133230221 |
5 | 121142011232413001 |
6 | 2205552052331001 |
7 | 143126546005510 |
oct | 20117024375451 |
9 | 3833365006561 |
10 | 1110120201001 |
11 | 398887a04879 |
12 | 15b195013a61 |
13 | 808b765cca6 |
14 | 3ba31599677 |
15 | 1dd241a4001 |
hex | 1027851fb29 |
1110120201001 has 4 divisors (see below), whose sum is σ = 1268708801152. Its totient is φ = 951531600852.
The previous prime is 1110120200929. The next prime is 1110120201011. The reversal of 1110120201001 is 1001020210111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1110120201001 - 29 = 1110120200489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110120201011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79294300065 + ... + 79294300078.
It is an arithmetic number, because the mean of its divisors is an integer number (317177200288).
Almost surely, 21110120201001 is an apocalyptic number.
It is an amenable number.
1110120201001 is a deficient number, since it is larger than the sum of its proper divisors (158588600151).
1110120201001 is an equidigital number, since it uses as much as digits as its factorization.
1110120201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158588600150.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1110120201001 its reverse (1001020210111), we get a palindrome (2111140411112).
The spelling of 1110120201001 in words is "one trillion, one hundred ten billion, one hundred twenty million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •