Base | Representation |
---|---|
bin | 1001110011011001100… |
… | …1001111111011000111 |
3 | 121002201020000011000101 |
4 | 2130312121033323013 |
5 | 10224404034004111 |
6 | 205211442024531 |
7 | 15111341016661 |
oct | 2346631177307 |
9 | 532636004011 |
10 | 168416313031 |
11 | 6547468876a |
12 | 28782348147 |
13 | 12b5cb134c5 |
14 | 82195cb531 |
15 | 45aa7bebc1 |
hex | 273664fec7 |
168416313031 has 4 divisors (see below), whose sum is σ = 178323154992. Its totient is φ = 158509471072.
The previous prime is 168416313019. The next prime is 168416313053. The reversal of 168416313031 is 130313614861.
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 168416313031 - 213 = 168416304839 is a prime.
It is a super-2 number, since 2×1684163130312 (a number of 23 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 (168416353031) 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 3 ways as a sum of consecutive naturals, for example, 4953420955 + ... + 4953420988.
It is an arithmetic number, because the mean of its divisors is an integer number (44580788748).
Almost surely, 2168416313031 is an apocalyptic number.
168416313031 is a deficient number, since it is larger than the sum of its proper divisors (9906841961).
168416313031 is an equidigital number, since it uses as much as digits as its factorization.
168416313031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9906841960.
The product of its (nonzero) digits is 31104, while the sum is 37.
Adding to 168416313031 its reverse (130313614861), we get a palindrome (298729927892).
The spelling of 168416313031 in words is "one hundred sixty-eight billion, four hundred sixteen million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •