Base | Representation |
---|---|
bin | 10101010000011010… |
… | …11100111100010101 |
3 | 1002110022202100200001 |
4 | 22220031130330111 |
5 | 141332440031201 |
6 | 5124223251301 |
7 | 552541453054 |
oct | 125015347425 |
9 | 32408670601 |
10 | 11412033301 |
11 | 4926882589 |
12 | 2265a49b31 |
13 | 10cb3c0136 |
14 | 7a38c839b |
15 | 46bd2d301 |
hex | 2a835cf15 |
11412033301 has 8 divisors (see below), whose sum is σ = 11497290560. Its totient is φ = 11326821408.
The previous prime is 11412033233. The next prime is 11412033307. The reversal of 11412033301 is 10333021411.
11412033301 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 not a de Polignac number, because 11412033301 - 225 = 11378478869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11412033307) 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, 625825 + ... + 643801.
It is an arithmetic number, because the mean of its divisors is an integer number (1437161320).
Almost surely, 211412033301 is an apocalyptic number.
It is an amenable number.
11412033301 is a deficient number, since it is larger than the sum of its proper divisors (85257259).
11412033301 is a wasteful number, since it uses less digits than its factorization.
11412033301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22683.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11412033301 its reverse (10333021411), we get a palindrome (21745054712).
The spelling of 11412033301 in words is "eleven billion, four hundred twelve million, thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •