Base | Representation |
---|---|
bin | 1000001100110001… |
… | …0001001000111111 |
3 | 12200101121222020020 |
4 | 2003030101020333 |
5 | 14001430444411 |
6 | 1002223423223 |
7 | 105354312450 |
oct | 20314211077 |
9 | 5611558206 |
10 | 2201031231 |
11 | a2a474383 |
12 | 515154b13 |
13 | 291002b59 |
14 | 16c469127 |
15 | cd372606 |
hex | 8331123f |
2201031231 has 32 divisors (see below), whose sum is σ = 3538944000. Its totient is φ = 1188678240.
The previous prime is 2201031221. The next prime is 2201031257. The reversal of 2201031231 is 1321301022.
It is not a de Polignac number, because 2201031231 - 217 = 2200900159 is a prime.
It is a super-2 number, since 2×22010312312 = 9689076959674750722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2201031231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201031221) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 165570 + ... + 178368.
It is an arithmetic number, because the mean of its divisors is an integer number (110592000).
Almost surely, 22201031231 is an apocalyptic number.
2201031231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2201031231 is a deficient number, since it is larger than the sum of its proper divisors (1337912769).
2201031231 is a wasteful number, since it uses less digits than its factorization.
2201031231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13259.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 2201031231 is about 46915.1492697188. The cubic root of 2201031231 is about 1300.7946287775.
Adding to 2201031231 its reverse (1321301022), we get a palindrome (3522332253).
The spelling of 2201031231 in words is "two billion, two hundred one million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •