Base | Representation |
---|---|
bin | 1100111011110010000… |
… | …1100010111001100100 |
3 | 210020112221020200100210 |
4 | 3032330201202321210 |
5 | 12120034244224104 |
6 | 250025150535420 |
7 | 22024322616336 |
oct | 3167441427144 |
9 | 706487220323 |
10 | 222206242404 |
11 | 862676a3853 |
12 | 37094507570 |
13 | 17c52b02893 |
14 | aa7d3cb456 |
15 | 5ba7c41989 |
hex | 33bc862e64 |
222206242404 has 48 divisors (see below), whose sum is σ = 522750412800. Its totient is φ = 73459282176.
The previous prime is 222206242367. The next prime is 222206242451. The reversal of 222206242404 is 404242602222.
222206242404 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2222062424042 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 4500202 + ... + 4549310.
It is an arithmetic number, because the mean of its divisors is an integer number (10890633600).
Almost surely, 2222206242404 is an apocalyptic number.
It is an amenable number.
222206242404 is an abundant number, since it is smaller than the sum of its proper divisors (300544170396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222206242404 is a wasteful number, since it uses less digits than its factorization.
222206242404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52212 (or 52210 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 30.
Adding to 222206242404 its reverse (404242602222), we get a palindrome (626448844626).
The spelling of 222206242404 in words is "two hundred twenty-two billion, two hundred six million, two hundred forty-two thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •