Base | Representation |
---|---|
bin | 101111111000111011001010… |
… | …1001110111100101000010011 |
3 | 2001020111011002122120222002001 |
4 | 1133301312111032330220103 |
5 | 420203044020332311311 |
6 | 4051522553432534431 |
7 | 154504405111243102 |
oct | 13761662516745023 |
9 | 2036434078528061 |
10 | 421240011213331 |
11 | 112246981697582 |
12 | 3b2b3177551417 |
13 | 151079bb5c693b |
14 | 76041a7c7a039 |
15 | 33a764564e4c1 |
hex | 17f1d953bca13 |
421240011213331 has 2 divisors, whose sum is σ = 421240011213332. Its totient is φ = 421240011213330.
The previous prime is 421240011213277. The next prime is 421240011213341. The reversal of 421240011213331 is 133312110042124.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 421240011213331 - 245 = 386055639124499 is a prime.
It is a super-2 number, since 2×4212400112133312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 421240011213331.
It is not a weakly prime, because it can be changed into another prime (421240011213341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210620005606665 + 210620005606666.
It is an arithmetic number, because the mean of its divisors is an integer number (210620005606666).
Almost surely, 2421240011213331 is an apocalyptic number.
421240011213331 is a deficient number, since it is larger than the sum of its proper divisors (1).
421240011213331 is an equidigital number, since it uses as much as digits as its factorization.
421240011213331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 421240011213331 its reverse (133312110042124), we get a palindrome (554552121255455).
The spelling of 421240011213331 in words is "four hundred twenty-one trillion, two hundred forty billion, eleven million, two hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •