Base | Representation |
---|---|
bin | 10100111100011001… |
… | …11001010000111001 |
3 | 1002000121210020001202 |
4 | 22132030321100321 |
5 | 141011443140001 |
6 | 5055424223545 |
7 | 545432254250 |
oct | 123614712071 |
9 | 32017706052 |
10 | 11244115001 |
11 | 4850012029 |
12 | 221976abb5 |
13 | 10a26894b2 |
14 | 789497797 |
15 | 45c20e96b |
hex | 29e339439 |
11244115001 has 8 divisors (see below), whose sum is σ = 12886823424. Its totient is φ = 9610508160.
The previous prime is 11244114979. The next prime is 11244115033. The reversal of 11244115001 is 10051144211.
11244115001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11244115001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11244115601) 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 7 ways as a sum of consecutive naturals, for example, 2272745 + ... + 2277686.
It is an arithmetic number, because the mean of its divisors is an integer number (1610852928).
Almost surely, 211244115001 is an apocalyptic number.
It is an amenable number.
11244115001 is a deficient number, since it is larger than the sum of its proper divisors (1642708423).
11244115001 is an equidigital number, since it uses as much as digits as its factorization.
11244115001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4550791.
The product of its (nonzero) digits is 160, while the sum is 20.
Adding to 11244115001 its reverse (10051144211), we get a palindrome (21295259212).
The spelling of 11244115001 in words is "eleven billion, two hundred forty-four million, one hundred fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •