Base | Representation |
---|---|
bin | 10000001101101110100… |
… | …011001101110101110001 |
3 | 10221112002002022112120200 |
4 | 100031232203031311301 |
5 | 121223441310131103 |
6 | 2211514023225413 |
7 | 143334120253251 |
oct | 20155643156561 |
9 | 3845062275520 |
10 | 1114251255153 |
11 | 39a60786aa13 |
12 | 15bb485a8269 |
13 | 810c5478c2a |
14 | 3bd040a5961 |
15 | 1deb6bb50a3 |
hex | 1036e8cdd71 |
1114251255153 has 12 divisors (see below), whose sum is σ = 1625099998080. Its totient is φ = 735622187256.
The previous prime is 1114251255133. The next prime is 1114251255167. The reversal of 1114251255153 is 3515521524111.
1114251255153 is a `hidden beast` number, since 1 + 1 + 1 + 4 + 2 + 51 + 2 + 551 + 53 = 666.
It is not a de Polignac number, because 1114251255153 - 213 = 1114251246961 is a prime.
It is a super-2 number, since 2×11142512551532 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1114251255133) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 600997593 + ... + 600999446.
It is an arithmetic number, because the mean of its divisors is an integer number (135424999840).
Almost surely, 21114251255153 is an apocalyptic number.
It is an amenable number.
1114251255153 is a deficient number, since it is larger than the sum of its proper divisors (510848742927).
1114251255153 is a wasteful number, since it uses less digits than its factorization.
1114251255153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1201997148 (or 1201997145 counting only the distinct ones).
The product of its digits is 30000, while the sum is 36.
Adding to 1114251255153 its reverse (3515521524111), we get a palindrome (4629772779264).
The spelling of 1114251255153 in words is "one trillion, one hundred fourteen billion, two hundred fifty-one million, two hundred fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •