Base | Representation |
---|---|
bin | 110000000000110111110110… |
… | …0110000111011111001011001 |
3 | 2001101100120202012111220022022 |
4 | 1200001233230300323321121 |
5 | 420323443224231343301 |
6 | 4054120454330304225 |
7 | 154646336421022466 |
oct | 14001575460737131 |
9 | 2041316665456268 |
10 | 422332401434201 |
11 | 112628190476905 |
12 | 3b44aa22888075 |
13 | 15186a0b95820b |
14 | 7640dd681666d |
15 | 33c5c7ced5d1b |
hex | 1801becc3be59 |
422332401434201 has 8 divisors (see below), whose sum is σ = 431436296004480. Its totient is φ = 413270557186032.
The previous prime is 422332401434173. The next prime is 422332401434233. The reversal of 422332401434201 is 102434104233224.
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 422332401434201 - 26 = 422332401434137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (422332401436201) 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, 10512560225 + ... + 10512600398.
It is an arithmetic number, because the mean of its divisors is an integer number (53929537000560).
Almost surely, 2422332401434201 is an apocalyptic number.
It is an amenable number.
422332401434201 is a deficient number, since it is larger than the sum of its proper divisors (9103894570279).
422332401434201 is a wasteful number, since it uses less digits than its factorization.
422332401434201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21025161055.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 422332401434201 its reverse (102434104233224), we get a palindrome (524766505667425).
The spelling of 422332401434201 in words is "four hundred twenty-two trillion, three hundred thirty-two billion, four hundred one million, four hundred thirty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •