Base | Representation |
---|---|
bin | 10100100100100011… |
… | …11110011011101101 |
3 | 1001111200110102220122 |
4 | 22102101332123231 |
5 | 140104243322201 |
6 | 5023521454325 |
7 | 540453321314 |
oct | 122221763355 |
9 | 31450412818 |
10 | 11044120301 |
11 | 4758133055 |
12 | 21827a13a5 |
13 | 1070104736 |
14 | 76aab727b |
15 | 4498a6e1b |
hex | 29247e6ed |
11044120301 has 8 divisors (see below), whose sum is σ = 11541408384. Its totient is φ = 10557761760.
The previous prime is 11044120277. The next prime is 11044120303. The reversal of 11044120301 is 10302144011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11044120301 - 26 = 11044120237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11044120301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11044120303) 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 7 ways as a sum of consecutive naturals, for example, 2730320 + ... + 2734361.
It is an arithmetic number, because the mean of its divisors is an integer number (1442676048).
Almost surely, 211044120301 is an apocalyptic number.
It is an amenable number.
11044120301 is a deficient number, since it is larger than the sum of its proper divisors (497288083).
11044120301 is an equidigital number, since it uses as much as digits as its factorization.
11044120301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5464771.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 11044120301 its reverse (10302144011), we get a palindrome (21346264312).
The spelling of 11044120301 in words is "eleven billion, forty-four million, one hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •