Base | Representation |
---|---|
bin | 10011001100110001011111… |
… | …11010100100011000110111 |
3 | 12112111020001120001121011110 |
4 | 21212120233322210120313 |
5 | 21013214220043332411 |
6 | 225443430345210103 |
7 | 11615214124054314 |
oct | 1146305772443067 |
9 | 175436046047143 |
10 | 42220332402231 |
11 | 124a85a6a60865 |
12 | 489a6bba90933 |
13 | 1a7348b659c29 |
14 | a5d69153bd0b |
15 | 4d33ab1992a6 |
hex | 26662fea4637 |
42220332402231 has 8 divisors (see below), whose sum is σ = 56299771012864. Its totient is φ = 28143891029880.
The previous prime is 42220332402223. The next prime is 42220332402233. The reversal of 42220332402231 is 13220423302224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42220332402231 - 23 = 42220332402223 is a prime.
It is a super-2 number, since 2×422203324022312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42220332402233) 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, 749276701 + ... + 749333046.
It is an arithmetic number, because the mean of its divisors is an integer number (7037471376608).
Almost surely, 242220332402231 is an apocalyptic number.
42220332402231 is a deficient number, since it is larger than the sum of its proper divisors (14079438610633).
42220332402231 is a wasteful number, since it uses less digits than its factorization.
42220332402231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1498619141.
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 42220332402231 its reverse (13220423302224), we get a palindrome (55440755704455).
The spelling of 42220332402231 in words is "forty-two trillion, two hundred twenty billion, three hundred thirty-two million, four hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •