Base | Representation |
---|---|
bin | 100001001101001… |
… | …1111111111010110 |
3 | 2212122122102002101 |
4 | 1002122133333112 |
5 | 4240221234110 |
6 | 302322032314 |
7 | 36416623645 |
oct | 10232377726 |
9 | 2778572071 |
10 | 1114243030 |
11 | 521a6330a |
12 | 2711a869a |
13 | 149ac9904 |
14 | a7da935c |
15 | 67c4b13a |
hex | 4269ffd6 |
1114243030 has 16 divisors (see below), whose sum is σ = 2111197680. Its totient is φ = 422239392.
The previous prime is 1114243007. The next prime is 1114243033. The reversal of 1114243030 is 303424111.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 1114242989 and 1114243007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114243033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2932029 + ... + 2932408.
It is an arithmetic number, because the mean of its divisors is an integer number (131949855).
Almost surely, 21114243030 is an apocalyptic number.
1114243030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1114243030 is a deficient number, since it is larger than the sum of its proper divisors (996954650).
1114243030 is a wasteful number, since it uses less digits than its factorization.
1114243030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5864463.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1114243030 is about 33380.2790581505. The cubic root of 1114243030 is about 1036.7164157407.
Adding to 1114243030 its reverse (303424111), we get a palindrome (1417667141).
The spelling of 1114243030 in words is "one billion, one hundred fourteen million, two hundred forty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •