Base | Representation |
---|---|
bin | 1100110111110000001… |
… | …0111010010110010010 |
3 | 210010202112200221211012 |
4 | 3031330002322112102 |
5 | 12110330331021122 |
6 | 245325544450522 |
7 | 21655445661401 |
oct | 3157402722622 |
9 | 703675627735 |
10 | 221124470162 |
11 | 85861aa9302 |
12 | 36a32179a42 |
13 | 17b0c96476b |
14 | a9b9875638 |
15 | 5b42cab7e2 |
hex | 337c0ba592 |
221124470162 has 6 divisors (see below), whose sum is σ = 331687702773. Its totient is φ = 110561902572.
The previous prime is 221124470143. The next prime is 221124470173. The reversal of 221124470162 is 261074421122.
221124470162 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 219247761121 + 1876709041 = 468239^2 + 43321^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=332509.
It is a Duffinian number.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 498764 + ... + 831272.
Almost surely, 2221124470162 is an apocalyptic number.
221124470162 is a deficient number, since it is larger than the sum of its proper divisors (110563232611).
221124470162 is an frugal number, since it uses more digits than its factorization.
221124470162 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665020 (or 332511 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 32.
Multiplying 221124470162 by its sum of digits (32), we get a square (7075983045184 = 26600722).
Adding to 221124470162 its reverse (261074421122), we get a palindrome (482198891284).
The spelling of 221124470162 in words is "two hundred twenty-one billion, one hundred twenty-four million, four hundred seventy thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •