Base | Representation |
---|---|
bin | 10000010011010001001… |
… | …100011111100010010001 |
3 | 10222002102202012120012202 |
4 | 100103101030133202101 |
5 | 121323133002210001 |
6 | 2214340251332545 |
7 | 143634426115346 |
oct | 20232114374221 |
9 | 3862382176182 |
10 | 1120201210001 |
11 | 3a209041a075 |
12 | 161129151155 |
13 | 81833071b83 |
14 | 3c30a3a87cd |
15 | 1e21421496b |
hex | 104d131f891 |
1120201210001 has 4 divisors (see below), whose sum is σ = 1135978691904. Its totient is φ = 1104423728100.
The previous prime is 1120201209997. The next prime is 1120201210013. The reversal of 1120201210001 is 1000121020211.
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 a cyclic number.
It is not a de Polignac number, because 1120201210001 - 22 = 1120201209997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120201210021) 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 3 ways as a sum of consecutive naturals, for example, 7888740845 + ... + 7888740986.
It is an arithmetic number, because the mean of its divisors is an integer number (283994672976).
Almost surely, 21120201210001 is an apocalyptic number.
It is an amenable number.
1120201210001 is a deficient number, since it is larger than the sum of its proper divisors (15777481903).
1120201210001 is an equidigital number, since it uses as much as digits as its factorization.
1120201210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15777481902.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1120201210001 its reverse (1000121020211), we get a palindrome (2120322230212).
The spelling of 1120201210001 in words is "one trillion, one hundred twenty billion, two hundred one million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •