Base | Representation |
---|---|
bin | 10101001111001001… |
… | …11100011001000011 |
3 | 1002102120202212000102 |
4 | 22213210330121003 |
5 | 141322230223321 |
6 | 5123203513015 |
7 | 552352264445 |
oct | 124744743103 |
9 | 32376685012 |
10 | 11401414211 |
11 | 492088a280 |
12 | 226238876b |
13 | 10c9142855 |
14 | 7a2322495 |
15 | 46ae31c0b |
hex | 2a793c643 |
11401414211 has 16 divisors (see below), whose sum is σ = 12604491648. Its totient is φ = 10226880000.
The previous prime is 11401414159. The next prime is 11401414243. The reversal of 11401414211 is 11241410411.
11401414211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11401414211 - 230 = 10327672387 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11401414511) 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 15 ways as a sum of consecutive naturals, for example, 276131 + ... + 314723.
It is an arithmetic number, because the mean of its divisors is an integer number (787780728).
Almost surely, 211401414211 is an apocalyptic number.
11401414211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11401414211 is a deficient number, since it is larger than the sum of its proper divisors (1203077437).
11401414211 is a wasteful number, since it uses less digits than its factorization.
11401414211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38962.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 11401414211 its reverse (11241410411), we get a palindrome (22642824622).
The spelling of 11401414211 in words is "eleven billion, four hundred one million, four hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •