Base | Representation |
---|---|
bin | 100001001001001… |
… | …1100011011110001 |
3 | 2212111200010100122 |
4 | 1002102130123301 |
5 | 4234201200223 |
6 | 302204500025 |
7 | 36362650226 |
oct | 10222343361 |
9 | 2774603318 |
10 | 1112131313 |
11 | 520850797 |
12 | 27054a615 |
13 | 14953a687 |
14 | a79b994d |
15 | 679805c8 |
hex | 4249c6f1 |
1112131313 has 8 divisors (see below), whose sum is σ = 1239527520. Its totient is φ = 991621440.
The previous prime is 1112131283. The next prime is 1112131327. The reversal of 1112131313 is 3131312111.
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 1112131313 - 212 = 1112127217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1112131291 and 1112131300.
It is not an unprimeable number, because it can be changed into a prime (1112131393) 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, 1721243 + ... + 1721888.
It is an arithmetic number, because the mean of its divisors is an integer number (154940940).
Almost surely, 21112131313 is an apocalyptic number.
It is an amenable number.
1112131313 is a deficient number, since it is larger than the sum of its proper divisors (127396207).
1112131313 is a wasteful number, since it uses less digits than its factorization.
1112131313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3443167.
The product of its digits is 54, while the sum is 17.
The square root of 1112131313 is about 33348.6328505383. The cubic root of 1112131313 is about 1036.0610721266.
Adding to 1112131313 its reverse (3131312111), we get a palindrome (4243443424).
The spelling of 1112131313 in words is "one billion, one hundred twelve million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •