Base | Representation |
---|---|
bin | 100001010100101… |
… | …1000011110010001 |
3 | 2212220222121202121 |
4 | 1002221120132101 |
5 | 4242221110101 |
6 | 302541414241 |
7 | 36465033133 |
oct | 10251303621 |
9 | 2786877677 |
10 | 1118144401 |
11 | 524188490 |
12 | 27256a381 |
13 | 14a86460a |
14 | a8703053 |
15 | 6826c0a1 |
hex | 42a58791 |
1118144401 has 8 divisors (see below), whose sum is σ = 1220665824. Its totient is φ = 1015768320.
The previous prime is 1118144393. The next prime is 1118144491. The reversal of 1118144401 is 1044418111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1118144401 - 23 = 1118144393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1118144491) 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 7 ways as a sum of consecutive naturals, for example, 19920 + ... + 51313.
It is an arithmetic number, because the mean of its divisors is an integer number (152583228).
Almost surely, 21118144401 is an apocalyptic number.
1118144401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1118144401 is a deficient number, since it is larger than the sum of its proper divisors (102521423).
1118144401 is a wasteful number, since it uses less digits than its factorization.
1118144401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72671.
The product of its (nonzero) digits is 512, while the sum is 25.
The square root of 1118144401 is about 33438.6662562968. Note that the first 3 decimals coincide. The cubic root of 1118144401 is about 1037.9249803161.
The spelling of 1118144401 in words is "one billion, one hundred eighteen million, one hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •