Base | Representation |
---|---|
bin | 10000010100000111111… |
… | …101011001101111110011 |
3 | 10222011210210001222112102 |
4 | 100110013331121233303 |
5 | 121332023210013021 |
6 | 2215011352251015 |
7 | 143666253526343 |
oct | 20240775315763 |
9 | 3864723058472 |
10 | 1121120001011 |
11 | 3a251201638a |
12 | 1613449a0a6b |
13 | 8194b5175aa |
14 | 3c396416d23 |
15 | 1e269c0400b |
hex | 10507f59bf3 |
1121120001011 has 4 divisors (see below), whose sum is σ = 1121124932400. Its totient is φ = 1121115069624.
The previous prime is 1121120001007. The next prime is 1121120001037. The reversal of 1121120001011 is 1101000211211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1121120001011 - 22 = 1121120001007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121120000983 and 1121120001001.
It is not an unprimeable number, because it can be changed into a prime (1121120001061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2107316 + ... + 2585153.
It is an arithmetic number, because the mean of its divisors is an integer number (280281233100).
Almost surely, 21121120001011 is an apocalyptic number.
1121120001011 is a deficient number, since it is larger than the sum of its proper divisors (4931389).
1121120001011 is an equidigital number, since it uses as much as digits as its factorization.
1121120001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4931388.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1121120001011 its reverse (1101000211211), we get a palindrome (2222120212222).
The spelling of 1121120001011 in words is "one trillion, one hundred twenty-one billion, one hundred twenty million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •