Base | Representation |
---|---|
bin | 10000010100011010011… |
… | …100110101100001110001 |
3 | 10222012121101211022021200 |
4 | 100110122130311201301 |
5 | 121333142114344103 |
6 | 2215102233441413 |
7 | 144010041454401 |
oct | 20243234654161 |
9 | 3865541738250 |
10 | 1121430231153 |
11 | 3a2661147931 |
12 | 161410870269 |
13 | 8199a88791b |
14 | 3c3c56d0801 |
15 | 1e2870840a3 |
hex | 1051a735871 |
1121430231153 has 24 divisors (see below), whose sum is σ = 1647961492008. Its totient is φ = 734716645632.
The previous prime is 1121430231133. The next prime is 1121430231191. The reversal of 1121430231153 is 3511320341211.
1121430231153 is a `hidden beast` number, since 112 + 1 + 430 + 2 + 3 + 115 + 3 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 641710224 + 1120788520929 = 25332^2 + 1058673^2 .
It is not a de Polignac number, because 1121430231153 - 216 = 1121430165617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1121430231133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2899050 + ... + 3263027.
It is an arithmetic number, because the mean of its divisors is an integer number (68665062167).
Almost surely, 21121430231153 is an apocalyptic number.
It is an amenable number.
1121430231153 is a deficient number, since it is larger than the sum of its proper divisors (526531260855).
1121430231153 is a wasteful number, since it uses less digits than its factorization.
1121430231153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6162433 (or 6162430 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 1121430231153 its reverse (3511320341211), we get a palindrome (4632750572364).
The spelling of 1121430231153 in words is "one trillion, one hundred twenty-one billion, four hundred thirty million, two hundred thirty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •