Base | Representation |
---|---|
bin | 1100110111100001111… |
… | …0001001110001000110 |
3 | 210010121100212021102211 |
4 | 3031320132021301012 |
5 | 12110220003033332 |
6 | 245320003254034 |
7 | 21654120160165 |
oct | 3157036116106 |
9 | 703540767384 |
10 | 221064502342 |
11 | 8583116a622 |
12 | 36a1607a31a |
13 | 17b003c9348 |
14 | a9b19053dc |
15 | 5b3c8b3447 |
hex | 3378789c46 |
221064502342 has 8 divisors (see below), whose sum is σ = 336139175016. Its totient is φ = 109018110672.
The previous prime is 221064502339. The next prime is 221064502343. The reversal of 221064502342 is 243205460122.
221064502342 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2210645023422 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221064502343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 757070068 + ... + 757070359.
It is an arithmetic number, because the mean of its divisors is an integer number (42017396877).
Almost surely, 2221064502342 is an apocalyptic number.
221064502342 is a deficient number, since it is larger than the sum of its proper divisors (115074672674).
221064502342 is a wasteful number, since it uses less digits than its factorization.
221064502342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514140502.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 221064502342 its reverse (243205460122), we get a palindrome (464269962464).
The spelling of 221064502342 in words is "two hundred twenty-one billion, sixty-four million, five hundred two thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •