Base | Representation |
---|---|
bin | 100001001101010… |
… | …0000110111111010 |
3 | 2212122122121001110 |
4 | 1002122200313322 |
5 | 4240221343100 |
6 | 302322101150 |
7 | 36416640336 |
oct | 10232406772 |
9 | 2778577043 |
10 | 1114246650 |
11 | 521a66000 |
12 | 2711aa7b6 |
13 | 149acb45a |
14 | a7daa7c6 |
15 | 67c4c250 |
hex | 426a0dfa |
1114246650 has 96 divisors (see below), whose sum is σ = 3040001856. Its totient is φ = 270072000.
The previous prime is 1114246643. The next prime is 1114246673. The reversal of 1114246650 is 566424111.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 196860 + ... + 202440.
It is an arithmetic number, because the mean of its divisors is an integer number (31666686).
Almost surely, 21114246650 is an apocalyptic number.
1114246650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1114246650, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1520000928).
1114246650 is an abundant number, since it is smaller than the sum of its proper divisors (1925755206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114246650 is a wasteful number, since it uses less digits than its factorization.
1114246650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5629 (or 5602 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The square root of 1114246650 is about 33380.3332817394. Note that the first 3 decimals coincide. The cubic root of 1114246650 is about 1036.7175384489.
The spelling of 1114246650 in words is "one billion, one hundred fourteen million, two hundred forty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •