Base | Representation |
---|---|
bin | 100001001110001… |
… | …1111011011010101 |
3 | 2212200121221010002 |
4 | 1002130133123111 |
5 | 4240334440023 |
6 | 302341141045 |
7 | 36424226525 |
oct | 10234373325 |
9 | 2780557102 |
10 | 1114765013 |
11 | 52228a4aa |
12 | 2713ba785 |
13 | 149c5038b |
14 | a80a3685 |
15 | 67d00b28 |
hex | 4271f6d5 |
1114765013 has 8 divisors (see below), whose sum is σ = 1118626080. Its totient is φ = 1110911760.
The previous prime is 1114765007. The next prime is 1114765019. The reversal of 1114765013 is 3105674111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1114765007) and next prime (1114765019).
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 1114765013 - 24 = 1114764997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114765019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 430958 + ... + 433536.
It is an arithmetic number, because the mean of its divisors is an integer number (139828260).
Almost surely, 21114765013 is an apocalyptic number.
It is an amenable number.
1114765013 is a deficient number, since it is larger than the sum of its proper divisors (3861067).
1114765013 is an equidigital number, since it uses as much as digits as its factorization.
1114765013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3907.
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 1114765013 is about 33388.0968759826. The cubic root of 1114765013 is about 1036.8782786526.
The spelling of 1114765013 in words is "one billion, one hundred fourteen million, seven hundred sixty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •