Base | Representation |
---|---|
bin | 1111001100101010001001… |
… | …0000011111001110010111 |
3 | 2012011110210201220020112002 |
4 | 3303022202100133032113 |
5 | 4142234334110401011 |
6 | 55312311252145515 |
7 | 3343160654022350 |
oct | 363124220371627 |
9 | 65143721806462 |
10 | 16710145012631 |
11 | 5362807255224 |
12 | 1a5a65590829b |
13 | 9429b56b64b5 |
14 | 41aabd732d27 |
15 | 1dea08937c3b |
hex | f32a241f397 |
16710145012631 has 4 divisors (see below), whose sum is σ = 19097308585872. Its totient is φ = 14322981439392.
The previous prime is 16710145012609. The next prime is 16710145012637. The reversal of 16710145012631 is 13621054101761.
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 16710145012631 - 210 = 16710145011607 is a prime.
It is a super-2 number, since 2×167101450126312 (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 (16710145012637) 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, 1193581786610 + ... + 1193581786623.
It is an arithmetic number, because the mean of its divisors is an integer number (4774327146468).
Almost surely, 216710145012631 is an apocalyptic number.
16710145012631 is a deficient number, since it is larger than the sum of its proper divisors (2387163573241).
16710145012631 is an equidigital number, since it uses as much as digits as its factorization.
16710145012631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2387163573240.
The product of its (nonzero) digits is 30240, while the sum is 38.
The spelling of 16710145012631 in words is "sixteen trillion, seven hundred ten billion, one hundred forty-five million, twelve thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •