Base | Representation |
---|---|
bin | 1001001111110111011011… |
… | …0110110100100100100111 |
3 | 1100000001212001201102011202 |
4 | 2103331312312310210213 |
5 | 2313043414002002411 |
6 | 33343110445553115 |
7 | 2066425010102312 |
oct | 223756666644447 |
9 | 40001761642152 |
10 | 10168181672231 |
11 | 3270335519670 |
12 | 11827b357579b |
13 | 589b174762cb |
14 | 2721dd4bb979 |
15 | 12976ed1483b |
hex | 93f76db4927 |
10168181672231 has 8 divisors (see below), whose sum is σ = 11094491370000. Its totient is φ = 9242193565440.
The previous prime is 10168181672149. The next prime is 10168181672239. The reversal of 10168181672231 is 13227618186101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10168181672231 - 230 = 10167107930407 is a prime.
It is a super-2 number, since 2×101681816722312 (a number of 27 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 (10168181672239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80331626 + ... + 80458103.
It is an arithmetic number, because the mean of its divisors is an integer number (1386811421250).
Almost surely, 210168181672231 is an apocalyptic number.
10168181672231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10168181672231 is a deficient number, since it is larger than the sum of its proper divisors (926309697769).
10168181672231 is a wasteful number, since it uses less digits than its factorization.
10168181672231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160795489.
The product of its (nonzero) digits is 193536, while the sum is 47.
The spelling of 10168181672231 in words is "ten trillion, one hundred sixty-eight billion, one hundred eighty-one million, six hundred seventy-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •