Base | Representation |
---|---|
bin | 11110010101001011010… |
… | …11100011010100111111 |
3 | 10200122000001011220010021 |
4 | 33022211223203110333 |
5 | 114033321401240132 |
6 | 2114432410553011 |
7 | 135202511441026 |
oct | 17124553432477 |
9 | 3618001156107 |
10 | 1042161743167 |
11 | 371a84153636 |
12 | 149b89a38767 |
13 | 7737717646c |
14 | 38625b738bd |
15 | 1c197e0e997 |
hex | f2a5ae353f |
1042161743167 has 4 divisors (see below), whose sum is σ = 1103465375136. Its totient is φ = 980858111200.
The previous prime is 1042161743149. The next prime is 1042161743171. The reversal of 1042161743167 is 7613471612401.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1042161743167 - 235 = 1007802004799 is a prime.
It is a super-2 number, since 2×10421617431672 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042161743137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30651815959 + ... + 30651815992.
It is an arithmetic number, because the mean of its divisors is an integer number (275866343784).
Almost surely, 21042161743167 is an apocalyptic number.
1042161743167 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1042161743167 is a deficient number, since it is larger than the sum of its proper divisors (61303631969).
1042161743167 is an equidigital number, since it uses as much as digits as its factorization.
1042161743167 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61303631968.
The product of its (nonzero) digits is 169344, while the sum is 43.
The spelling of 1042161743167 in words is "one trillion, forty-two billion, one hundred sixty-one million, seven hundred forty-three thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •