Base | Representation |
---|---|
bin | 100001001011010… |
… | …0111010010000010 |
3 | 2212120201122200110 |
4 | 1002112213102002 |
5 | 4234441134242 |
6 | 302244132150 |
7 | 36405151650 |
oct | 10226472202 |
9 | 2776648613 |
10 | 1113224322 |
11 | 521427a01 |
12 | 270997056 |
13 | 149831022 |
14 | a7bc1dd0 |
15 | 67ae939c |
hex | 425a7482 |
1113224322 has 48 divisors (see below), whose sum is σ = 2629336896. Its totient is φ = 307792800.
The previous prime is 1113224293. The next prime is 1113224327. The reversal of 1113224322 is 2234223111.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1113224327) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26572 + ... + 54152.
It is an arithmetic number, because the mean of its divisors is an integer number (54777852).
Almost surely, 21113224322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1113224322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1314668448).
1113224322 is an abundant number, since it is smaller than the sum of its proper divisors (1516112574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113224322 is a wasteful number, since it uses less digits than its factorization.
1113224322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27655 (or 27624 counting only the distinct ones).
The product of its digits is 576, while the sum is 21.
The square root of 1113224322 is about 33365.0164393785. The cubic root of 1113224322 is about 1036.4003765718.
Adding to 1113224322 its reverse (2234223111), we get a palindrome (3347447433).
The spelling of 1113224322 in words is "one billion, one hundred thirteen million, two hundred twenty-four thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •