Base | Representation |
---|---|
bin | 101111110111001101011011… |
… | …0010101100101011010101111 |
3 | 2001012122121210120000122010101 |
4 | 1133232122312111211122233 |
5 | 420140213343402300421 |
6 | 4051222420401451531 |
7 | 154451363046005332 |
oct | 13756326625453257 |
9 | 2035577716018111 |
10 | 421004343400111 |
11 | 112165a3731a399 |
12 | 3b275566940ba7 |
13 | 150bb701903b53 |
14 | 75d6a0cad2619 |
15 | 33a1450bd4191 |
hex | 17ee6b65656af |
421004343400111 has 2 divisors, whose sum is σ = 421004343400112. Its totient is φ = 421004343400110.
The previous prime is 421004343400097. The next prime is 421004343400171. The reversal of 421004343400111 is 111004343400124.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 421004343400111 - 221 = 421004341302959 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421004343400111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421004343400171) 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, 210502171700055 + 210502171700056.
It is an arithmetic number, because the mean of its divisors is an integer number (210502171700056).
Almost surely, 2421004343400111 is an apocalyptic number.
421004343400111 is a deficient number, since it is larger than the sum of its proper divisors (1).
421004343400111 is an equidigital number, since it uses as much as digits as its factorization.
421004343400111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 421004343400111 its reverse (111004343400124), we get a palindrome (532008686800235).
The spelling of 421004343400111 in words is "four hundred twenty-one trillion, four billion, three hundred forty-three million, four hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •