Base | Representation |
---|---|
bin | 10101001111001000… |
… | …01011100101111101 |
3 | 1002102120101200211112 |
4 | 22213210023211331 |
5 | 141322202324313 |
6 | 5123155331405 |
7 | 552350502635 |
oct | 124744134575 |
9 | 32376350745 |
10 | 11401214333 |
11 | 4920763093 |
12 | 22622b0b65 |
13 | 10c90a2892 |
14 | 7a22ad6c5 |
15 | 46ade28a8 |
hex | 2a790b97d |
11401214333 has 16 divisors (see below), whose sum is σ = 12173328000. Its totient is φ = 10654543680.
The previous prime is 11401214323. The next prime is 11401214369. The reversal of 11401214333 is 33341210411.
It is a cyclic number.
It is not a de Polignac number, because 11401214333 - 212 = 11401210237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11401214299 and 11401214308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11401214323) 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 15 ways as a sum of consecutive naturals, for example, 181778 + ... + 236316.
It is an arithmetic number, because the mean of its divisors is an integer number (760833000).
Almost surely, 211401214333 is an apocalyptic number.
It is an amenable number.
11401214333 is a deficient number, since it is larger than the sum of its proper divisors (772113667).
11401214333 is a wasteful number, since it uses less digits than its factorization.
11401214333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54772.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11401214333 its reverse (33341210411), we get a palindrome (44742424744).
The spelling of 11401214333 in words is "eleven billion, four hundred one million, two hundred fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •