Base | Representation |
---|---|
bin | 100001011000010… |
… | …0000000001011011 |
3 | 2220001111102100010 |
4 | 1002300200001123 |
5 | 4243210312311 |
6 | 303045413003 |
7 | 36516634146 |
oct | 10260400133 |
9 | 2801442303 |
10 | 1120010331 |
11 | 525242380 |
12 | 27310a163 |
13 | 14b068a0b |
14 | a8a6b05d |
15 | 684d9da6 |
hex | 42c2005b |
1120010331 has 8 divisors (see below), whose sum is σ = 1629105984. Its totient is φ = 678794120.
The previous prime is 1120010317. The next prime is 1120010341. The reversal of 1120010331 is 1330100211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1120010331 - 211 = 1120008283 is a prime.
It is a super-2 number, since 2×11200103312 = 2508846283093459122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1120010341) 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, 16969821 + ... + 16969886.
It is an arithmetic number, because the mean of its divisors is an integer number (203638248).
Almost surely, 21120010331 is an apocalyptic number.
1120010331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1120010331 is a deficient number, since it is larger than the sum of its proper divisors (509095653).
1120010331 is a wasteful number, since it uses less digits than its factorization.
1120010331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33939721.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1120010331 is about 33466.5554098416. Note that the first 3 decimals coincide. The cubic root of 1120010331 is about 1038.5020134352.
Adding to 1120010331 its reverse (1330100211), we get a palindrome (2450110542).
The spelling of 1120010331 in words is "one billion, one hundred twenty million, ten thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •