Base | Representation |
---|---|
bin | 100001001101001… |
… | …1000000001111110 |
3 | 2212122120202100222 |
4 | 1002122120001332 |
5 | 4240214213210 |
6 | 302321221342 |
7 | 36416426624 |
oct | 10232300176 |
9 | 2778522328 |
10 | 1114210430 |
11 | 521a40873 |
12 | 271191852 |
13 | 149ab7b18 |
14 | a7d9b514 |
15 | 67c41655 |
hex | 4269807e |
1114210430 has 32 divisors (see below), whose sum is σ = 2125240416. Its totient is φ = 419134464.
The previous prime is 1114210417. The next prime is 1114210439. The reversal of 1114210430 is 340124111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 1114210399 and 1114210408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114210439) 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 15 ways as a sum of consecutive naturals, for example, 361757 + ... + 364823.
It is an arithmetic number, because the mean of its divisors is an integer number (66413763).
Almost surely, 21114210430 is an apocalyptic number.
1114210430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1114210430 is a deficient number, since it is larger than the sum of its proper divisors (1011029986).
1114210430 is a wasteful number, since it uses less digits than its factorization.
1114210430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5228.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1114210430 is about 33379.7907423039. The cubic root of 1114210430 is about 1036.7063050546.
Adding to 1114210430 its reverse (340124111), we get a palindrome (1454334541).
The spelling of 1114210430 in words is "one billion, one hundred fourteen million, two hundred ten thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •