Base | Representation |
---|---|
bin | 100001001100111… |
… | …1111100011001001 |
3 | 2212122101122211000 |
4 | 1002121333203021 |
5 | 4240203011103 |
6 | 302315125213 |
7 | 36415531362 |
oct | 10231774311 |
9 | 2778348730 |
10 | 1114110153 |
11 | 5219824a2 |
12 | 271143809 |
13 | 149a812a0 |
14 | a7d72b69 |
15 | 67c21aa3 |
hex | 4267f8c9 |
1114110153 has 16 divisors (see below), whose sum is σ = 1777498240. Its totient is φ = 685606032.
The previous prime is 1114110121. The next prime is 1114110169. The reversal of 1114110153 is 3510114111.
1114110153 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1114110153 - 25 = 1114110121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1114110253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1586701 + ... + 1587402.
It is an arithmetic number, because the mean of its divisors is an integer number (111093640).
Almost surely, 21114110153 is an apocalyptic number.
1114110153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1114110153 is a deficient number, since it is larger than the sum of its proper divisors (663388087).
1114110153 is a wasteful number, since it uses less digits than its factorization.
1114110153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3174125 (or 3174119 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 18.
The square root of 1114110153 is about 33378.2886469633. The cubic root of 1114110153 is about 1036.6752035337.
Adding to 1114110153 its reverse (3510114111), we get a palindrome (4624224264).
The spelling of 1114110153 in words is "one billion, one hundred fourteen million, one hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •