Base | Representation |
---|---|
bin | 101111111111011010001101… |
… | …1011000001100001010000001 |
3 | 2001100122100201111100100102011 |
4 | 1133332310123120030022001 |
5 | 420312144420410412231 |
6 | 4053444241245452521 |
7 | 154625660426113333 |
oct | 13776643330141201 |
9 | 2040570644310364 |
10 | 422131320013441 |
11 | 11255a984230245 |
12 | 3b417a64b71141 |
13 | 15170a74591bcc |
14 | 763539cc71453 |
15 | 33c090eb4a9b1 |
hex | 17fed1b60c281 |
422131320013441 has 8 divisors (see below), whose sum is σ = 423563970614400. Its totient is φ = 420699043633968.
The previous prime is 422131320013387. The next prime is 422131320013471. The reversal of 422131320013441 is 144310023131224.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 422131320013441 - 29 = 422131320012929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (422131320013471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91295401 + ... + 95807686.
It is an arithmetic number, because the mean of its divisors is an integer number (52945496326800).
Almost surely, 2422131320013441 is an apocalyptic number.
It is an amenable number.
422131320013441 is a deficient number, since it is larger than the sum of its proper divisors (1432650600959).
422131320013441 is a wasteful number, since it uses less digits than its factorization.
422131320013441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187110743.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 422131320013441 its reverse (144310023131224), we get a palindrome (566441343144665).
The spelling of 422131320013441 in words is "four hundred twenty-two trillion, one hundred thirty-one billion, three hundred twenty million, thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •