Base | Representation |
---|---|
bin | 100001001101011… |
… | …0101100001000000 |
3 | 2212122210220000221 |
4 | 1002122311201000 |
5 | 4240232044300 |
6 | 302323552424 |
7 | 36420442003 |
oct | 10232654100 |
9 | 2778726027 |
10 | 1114331200 |
11 | 522013584 |
12 | 27122b714 |
13 | 149b2aa98 |
14 | a7dcd53a |
15 | 67c6731a |
hex | 426b5840 |
1114331200 has 42 divisors (see below), whose sum is σ = 2741955146. Its totient is φ = 445731840.
The previous prime is 1114331173. The next prime is 1114331213. The reversal of 1114331200 is 21334111.
It can be written as a sum of positive squares in 3 ways, for example, as 283046976 + 831284224 = 16824^2 + 28832^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 346629 + ... + 349828.
Almost surely, 21114331200 is an apocalyptic number.
1114331200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1114331200 is an abundant number, since it is smaller than the sum of its proper divisors (1627623946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1114331200 is an equidigital number, since it uses as much as digits as its factorization.
1114331200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696479 (or 696464 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1114331200 is about 33381.5997220025. The cubic root of 1114331200 is about 1036.7437601270.
Adding to 1114331200 its reverse (21334111), we get a palindrome (1135665311).
The spelling of 1114331200 in words is "one billion, one hundred fourteen million, three hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •