Base | Representation |
---|---|
bin | 11111000100001110100… |
… | …00001001100101110101 |
3 | 10210001012102000111010200 |
4 | 33202013100021211311 |
5 | 114442034242002112 |
6 | 2134211053311113 |
7 | 140055455124513 |
oct | 17420720114565 |
9 | 3701172014120 |
10 | 1067421047157 |
11 | 381766398583 |
12 | 152a59195499 |
13 | 7987132c19a |
14 | 399407394b3 |
15 | 1cb75752cdc |
hex | f887409975 |
1067421047157 has 24 divisors (see below), whose sum is σ = 1542775066560. Its totient is φ = 711178209600.
The previous prime is 1067421047153. The next prime is 1067421047213. The reversal of 1067421047157 is 7517401247601.
1067421047157 is a `hidden beast` number, since 10 + 67 + 421 + 0 + 4 + 7 + 157 = 666.
It is not a de Polignac number, because 1067421047157 - 22 = 1067421047153 is a prime.
It is a super-2 number, since 2×10674210471572 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1067421047153) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 197047513 + ... + 197052929.
It is an arithmetic number, because the mean of its divisors is an integer number (64282294440).
Almost surely, 21067421047157 is an apocalyptic number.
It is an amenable number.
1067421047157 is a deficient number, since it is larger than the sum of its proper divisors (475354019403).
1067421047157 is a wasteful number, since it uses less digits than its factorization.
1067421047157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14793 (or 14790 counting only the distinct ones).
The product of its (nonzero) digits is 329280, while the sum is 45.
The spelling of 1067421047157 in words is "one trillion, sixty-seven billion, four hundred twenty-one million, forty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •