Base | Representation |
---|---|
bin | 100000000001111101110… |
… | …000100010010100011000 |
3 | 21210102111202022120000111 |
4 | 200001331300202110120 |
5 | 242030410040143112 |
6 | 4403104150014104 |
7 | 315012062624053 |
oct | 40017560422430 |
9 | 7712452276014 |
10 | 2201133131032 |
11 | 77954a2a6110 |
12 | 2b6717047334 |
13 | 12c748564384 |
14 | 7876d255a9a |
15 | 3c3cab7e5a7 |
hex | 2007dc22518 |
2201133131032 has 32 divisors (see below), whose sum is σ = 4505109328080. Its totient is φ = 999894712960.
The previous prime is 2201133131009. The next prime is 2201133131039. The reversal of 2201133131032 is 2301313311022.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 2201133130994 and 2201133131012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201133131039) 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, 7611583 + ... + 7895470.
Almost surely, 22201133131032 is an apocalyptic number.
2201133131032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2201133131032 is an abundant number, since it is smaller than the sum of its proper divisors (2303976197048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201133131032 is a wasteful number, since it uses less digits than its factorization.
2201133131032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15508683 (or 15508679 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 2201133131032 its reverse (2301313311022), we get a palindrome (4502446442054).
The spelling of 2201133131032 in words is "two trillion, two hundred one billion, one hundred thirty-three million, one hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •