Base | Representation |
---|---|
bin | 10100101011010011… |
… | …010100011001010000 |
3 | 2010022020200222000122 |
4 | 110223103110121100 |
5 | 330432014233130 |
6 | 14111003205412 |
7 | 1414112054333 |
oct | 245323243120 |
9 | 63266628018 |
10 | 22201321040 |
11 | 9463081108 |
12 | 4377216868 |
13 | 212a77c672 |
14 | 11087c861a |
15 | 89e1492e5 |
hex | 52b4d4650 |
22201321040 has 40 divisors (see below), whose sum is σ = 51626113128. Its totient is φ = 8879144960.
The previous prime is 22201321033. The next prime is 22201321049. The reversal of 22201321040 is 4012310222.
It can be written as a sum of positive squares in 4 ways, for example, as 7103792656 + 15097528384 = 84284^2 + 122872^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×222013210402 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22201321049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 609584 + ... + 644976.
Almost surely, 222201321040 is an apocalyptic number.
22201321040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22201321040 is an abundant number, since it is smaller than the sum of its proper divisors (29424792088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22201321040 is a wasteful number, since it uses less digits than its factorization.
22201321040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43247 (or 43241 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 22201321040 its reverse (4012310222), we get a palindrome (26213631262).
The spelling of 22201321040 in words is "twenty-two billion, two hundred one million, three hundred twenty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •