Base | Representation |
---|---|
bin | 1011111111101111… |
… | …0100100101000000 |
3 | 22022102020120002020 |
4 | 2333323310211000 |
5 | 23043323130422 |
6 | 1251310321440 |
7 | 142540440303 |
oct | 27773644500 |
9 | 8272216066 |
10 | 3220130112 |
11 | 1402752461 |
12 | 75a4b9280 |
13 | 3c4199244 |
14 | 227948b3a |
15 | 13ca7795c |
hex | bfef4940 |
3220130112 has 56 divisors (see below), whose sum is σ = 8536545792. Its totient is φ = 1071283200.
The previous prime is 3220130107. The next prime is 3220130117. The reversal of 3220130112 is 2110310223.
It is an interprime number because it is at equal distance from previous prime (3220130107) and next prime (3220130117).
It is a junction number, because it is equal to n+sod(n) for n = 3220130091 and 3220130100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3220130117) 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, 83937 + ... + 116127.
Almost surely, 23220130112 is an apocalyptic number.
3220130112 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3220130112 is an abundant number, since it is smaller than the sum of its proper divisors (5316415680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3220130112 is a wasteful number, since it uses less digits than its factorization.
3220130112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32727 (or 32717 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 3220130112 is about 56746.1902862210. The cubic root of 3220130112 is about 1476.6961412406.
Adding to 3220130112 its reverse (2110310223), we get a palindrome (5330440335).
The spelling of 3220130112 in words is "three billion, two hundred twenty million, one hundred thirty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •