Base | Representation |
---|---|
bin | 11001111110001000111101… |
… | …111111000011111111010011 |
3 | 112222102110101202210112202021 |
4 | 121332020331333003333103 |
5 | 104432400411423231121 |
6 | 1042532330432432311 |
7 | 33026136530336623 |
oct | 3176107577037723 |
9 | 488373352715667 |
10 | 114221400211411 |
11 | 33438029745599 |
12 | 10988a579a8697 |
13 | 4b97054bb773c |
14 | 202c4b95b2883 |
15 | d31262795641 |
hex | 67e23dfc3fd3 |
114221400211411 has 2 divisors, whose sum is σ = 114221400211412. Its totient is φ = 114221400211410.
The previous prime is 114221400211313. The next prime is 114221400211421. The reversal of 114221400211411 is 114112004122411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114221400211411 - 223 = 114221391822803 is a prime.
It is a super-2 number, since 2×1142214002114112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (114221400211421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57110700105705 + 57110700105706.
It is an arithmetic number, because the mean of its divisors is an integer number (57110700105706).
Almost surely, 2114221400211411 is an apocalyptic number.
114221400211411 is a deficient number, since it is larger than the sum of its proper divisors (1).
114221400211411 is an equidigital number, since it uses as much as digits as its factorization.
114221400211411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 25.
Adding to 114221400211411 its reverse (114112004122411), we get a palindrome (228333404333822).
The spelling of 114221400211411 in words is "one hundred fourteen trillion, two hundred twenty-one billion, four hundred million, two hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •