Base | Representation |
---|---|
bin | 100001001101010… |
… | …0010101010001011 |
3 | 2212122122222002022 |
4 | 1002122202222023 |
5 | 4240222111323 |
6 | 302322155055 |
7 | 36420000554 |
oct | 10232425213 |
9 | 2778588068 |
10 | 1114253963 |
11 | 521a70549 |
12 | 2711b2a8b |
13 | 149b01894 |
14 | a7dad32b |
15 | 67c4e4c8 |
hex | 426a2a8b |
1114253963 has 4 divisors (see below), whose sum is σ = 1121351280. Its totient is φ = 1107156648.
The previous prime is 1114253953. The next prime is 1114253971. The reversal of 1114253963 is 3693524111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3693524111 = 3299 ⋅1119589.
It is a cyclic number.
It is not a de Polignac number, because 1114253963 - 24 = 1114253947 is a prime.
It is a super-2 number, since 2×11142539632 = 2483123788122410738, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1114253953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3548423 + ... + 3548736.
It is an arithmetic number, because the mean of its divisors is an integer number (280337820).
Almost surely, 21114253963 is an apocalyptic number.
1114253963 is a deficient number, since it is larger than the sum of its proper divisors (7097317).
1114253963 is an equidigital number, since it uses as much as digits as its factorization.
1114253963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7097316.
The product of its digits is 19440, while the sum is 35.
The square root of 1114253963 is about 33380.4428221077. The cubic root of 1114253963 is about 1036.7198064982.
The spelling of 1114253963 in words is "one billion, one hundred fourteen million, two hundred fifty-three thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •