Base | Representation |
---|---|
bin | 10000111110111111000… |
… | …011001100000110001000 |
3 | 11010120121002111101000122 |
4 | 100332333003030012020 |
5 | 123110301200441243 |
6 | 2252102151122412 |
7 | 150215565251642 |
oct | 20767703140610 |
9 | 4116532441018 |
10 | 1167141421448 |
11 | 40aa889a5752 |
12 | 16a249373408 |
13 | 860a3c25712 |
14 | 406c05ab892 |
15 | 20560155668 |
hex | 10fbf0cc188 |
1167141421448 has 36 divisors (see below), whose sum is σ = 2266626115845. Its totient is φ = 563404803360.
The previous prime is 1167141421421. The next prime is 1167141421493. The reversal of 1167141421448 is 8441241417611.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 1166447520484 + 693900964 = 1080022^2 + 26342^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=763918.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1167141421399 and 1167141421408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 88607903 + ... + 88621073.
Almost surely, 21167141421448 is an apocalyptic number.
It is an amenable number.
1167141421448 is a deficient number, since it is larger than the sum of its proper divisors (1099484694397).
1167141421448 is an frugal number, since it uses more digits than its factorization.
1167141421448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26406 (or 13202 counting only the distinct ones).
The product of its digits is 172032, while the sum is 44.
The spelling of 1167141421448 in words is "one trillion, one hundred sixty-seven billion, one hundred forty-one million, four hundred twenty-one thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •