Base | Representation |
---|---|
bin | 1110101111100011010111… |
… | …11100011000101110110111 |
3 | 11020210100021011101212002001 |
4 | 13113301223330120232313 |
5 | 13222133104340023023 |
6 | 152541351222000131 |
7 | 6554166243230206 |
oct | 727615374305667 |
9 | 136710234355061 |
10 | 32420224142263 |
11 | a36a3813756a1 |
12 | 377730b576047 |
13 | 15122a2277529 |
14 | 80120bd8d23d |
15 | 3b34cee436ad |
hex | 1d7c6bf18bb7 |
32420224142263 has 2 divisors, whose sum is σ = 32420224142264. Its totient is φ = 32420224142262.
The previous prime is 32420224142237. The next prime is 32420224142297. The reversal of 32420224142263 is 36224142202423.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 32420224142263 - 25 = 32420224142231 is a prime.
It is a super-2 number, since 2×324202241422632 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32420224142563) 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 as a sum of consecutive naturals, namely, 16210112071131 + 16210112071132.
It is an arithmetic number, because the mean of its divisors is an integer number (16210112071132).
Almost surely, 232420224142263 is an apocalyptic number.
32420224142263 is a deficient number, since it is larger than the sum of its proper divisors (1).
32420224142263 is an equidigital number, since it uses as much as digits as its factorization.
32420224142263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 221184, while the sum is 37.
Adding to 32420224142263 its reverse (36224142202423), we get a palindrome (68644366344686).
The spelling of 32420224142263 in words is "thirty-two trillion, four hundred twenty billion, two hundred twenty-four million, one hundred forty-two thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •