Base | Representation |
---|---|
bin | 11111000101001100100… |
… | …11111100011010001111 |
3 | 10210002112201112111212200 |
4 | 33202212103330122033 |
5 | 114444121141313224 |
6 | 2134334510132543 |
7 | 140104413242364 |
oct | 17424623743217 |
9 | 3702481474780 |
10 | 1067942135439 |
11 | 381a03548953 |
12 | 152b837b1153 |
13 | 79925288b4a |
14 | 3998da2046b |
15 | 1cba63845c9 |
hex | f8a64fc68f |
1067942135439 has 6 divisors (see below), whose sum is σ = 1542583084536. Its totient is φ = 711961423620.
The previous prime is 1067942135431. The next prime is 1067942135467. The reversal of 1067942135439 is 9345312497601.
1067942135439 is a `hidden beast` number, since 1 + 0 + 6 + 7 + 94 + 2 + 1 + 3 + 543 + 9 = 666.
It is not a de Polignac number, because 1067942135439 - 23 = 1067942135431 is a prime.
It is a super-2 number, since 2×10679421354392 (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 (1067942135431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 59330118627 + ... + 59330118644.
It is an arithmetic number, because the mean of its divisors is an integer number (257097180756).
Almost surely, 21067942135439 is an apocalyptic number.
1067942135439 is a deficient number, since it is larger than the sum of its proper divisors (474640949097).
1067942135439 is a wasteful number, since it uses less digits than its factorization.
1067942135439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118660237277 (or 118660237274 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 54.
The spelling of 1067942135439 in words is "one trillion, sixty-seven billion, nine hundred forty-two million, one hundred thirty-five thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •