Base | Representation |
---|---|
bin | 1100111011111010001… |
… | …0101101111111110001 |
3 | 210020122021222001100000 |
4 | 3032332202231333301 |
5 | 12120121431320213 |
6 | 250032400420213 |
7 | 22025213501424 |
oct | 3167642557761 |
9 | 706567861300 |
10 | 222240104433 |
11 | 862848218a6 |
12 | 370a3917669 |
13 | 17c59b2a699 |
14 | aa83ac39bb |
15 | 5baabcec73 |
hex | 33be8adff1 |
222240104433 has 48 divisors (see below), whose sum is σ = 353690326080. Its totient is φ = 139184692416.
The previous prime is 222240104431. The next prime is 222240104459. The reversal of 222240104433 is 334401042222.
222240104433 is a `hidden beast` number, since 2 + 2 + 224 + 0 + 1 + 0 + 4 + 433 = 666.
It is not a de Polignac number, because 222240104433 - 21 = 222240104431 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 222240104397 and 222240104406.
It is not an unprimeable number, because it can be changed into a prime (222240104431) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 165435 + ... + 686912.
It is an arithmetic number, because the mean of its divisors is an integer number (7368548460).
Almost surely, 2222240104433 is an apocalyptic number.
It is an amenable number.
222240104433 is a deficient number, since it is larger than the sum of its proper divisors (131450221647).
222240104433 is an equidigital number, since it uses as much as digits as its factorization.
222240104433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 852428 (or 852416 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
Adding to 222240104433 its reverse (334401042222), we get a palindrome (556641146655).
The spelling of 222240104433 in words is "two hundred twenty-two billion, two hundred forty million, one hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •