Base | Representation |
---|---|
bin | 101111111010001011101111… |
… | …0100100010001101010110111 |
3 | 2001021002200201100012220020022 |
4 | 1133310113132210101222313 |
5 | 420213412401244430033 |
6 | 4052134251133155355 |
7 | 154523041662530600 |
oct | 13764273644215267 |
9 | 2037080640186208 |
10 | 421413040233143 |
11 | 1123032a2aa6102 |
12 | 3b32080662bb5b |
13 | 1511b104c5602a |
14 | 760c6ddd10da7 |
15 | 33abdc0d72098 |
hex | 17f45de911ab7 |
421413040233143 has 12 divisors (see below), whose sum is σ = 490504723493400. Its totient is φ = 360997821585072.
The previous prime is 421413040233103. The next prime is 421413040233179. The reversal of 421413040233143 is 341332040314124.
It is not a de Polignac number, because 421413040233143 - 26 = 421413040233079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421413040233103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2539865693 + ... + 2540031606.
It is an arithmetic number, because the mean of its divisors is an integer number (40875393624450).
Almost surely, 2421413040233143 is an apocalyptic number.
421413040233143 is a deficient number, since it is larger than the sum of its proper divisors (69091683260257).
421413040233143 is a wasteful number, since it uses less digits than its factorization.
421413040233143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5079899006 (or 5079898999 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 421413040233143 its reverse (341332040314124), we get a palindrome (762745080547267).
The spelling of 421413040233143 in words is "four hundred twenty-one trillion, four hundred thirteen billion, forty million, two hundred thirty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •