Base | Representation |
---|---|
bin | 11101001000101110111… |
… | …01100010101001000001 |
3 | 10112201001211210010101121 |
4 | 32210113131202221001 |
5 | 112400243434000001 |
6 | 2043524133232241 |
7 | 132220466044423 |
oct | 16442735425101 |
9 | 3481054703347 |
10 | 1001121000001 |
11 | 356633783881 |
12 | 142035492681 |
13 | 735365bcb55 |
14 | 36651290813 |
15 | 1b094d996a1 |
hex | e917762a41 |
1001121000001 has 4 divisors (see below), whose sum is σ = 1001164498992. Its totient is φ = 1001077501012.
The previous prime is 1001120999987. The next prime is 1001121000029. The reversal of 1001121000001 is 1000001211001.
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 1001121000001 - 213 = 1001120991809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001121000041) 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, 21714955 + ... + 21761008.
It is an arithmetic number, because the mean of its divisors is an integer number (250291124748).
Almost surely, 21001121000001 is an apocalyptic number.
It is an amenable number.
1001121000001 is a deficient number, since it is larger than the sum of its proper divisors (43498991).
1001121000001 is an equidigital number, since it uses as much as digits as its factorization.
1001121000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43498990.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1001121000001 its reverse (1000001211001), we get a palindrome (2001122211002).
The spelling of 1001121000001 in words is "one trillion, one billion, one hundred twenty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •