Base | Representation |
---|---|
bin | 100101000111000100010010… |
… | …001000001000010111110111 |
3 | 210101220001012102120012121221 |
4 | 211013010102020020113313 |
5 | 132343041423210233011 |
6 | 1335043103015251211 |
7 | 46243530056365036 |
oct | 4507042210102767 |
9 | 711801172505557 |
10 | 163213356336631 |
11 | 48006439763597 |
12 | 1637ba12979b07 |
13 | 700bc519a9663 |
14 | 2c437d632871d |
15 | 13d08498c8971 |
hex | 9471122085f7 |
163213356336631 has 8 divisors (see below), whose sum is σ = 168478696393344. Its totient is φ = 157948040847360.
The previous prime is 163213356336601. The next prime is 163213356336647. The reversal of 163213356336631 is 136633653312361.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163213356336631 - 211 = 163213356334583 is a prime.
It is a super-2 number, since 2×1632133563366312 (a number of 29 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 (163213356336601) 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, 7866615 + ... + 19705591.
It is an arithmetic number, because the mean of its divisors is an integer number (21059837049168).
Almost surely, 2163213356336631 is an apocalyptic number.
163213356336631 is a deficient number, since it is larger than the sum of its proper divisors (5265340056713).
163213356336631 is a wasteful number, since it uses less digits than its factorization.
163213356336631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12283721.
The product of its digits is 9447840, while the sum is 52.
The spelling of 163213356336631 in words is "one hundred sixty-three trillion, two hundred thirteen billion, three hundred fifty-six million, three hundred thirty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •