Base | Representation |
---|---|
bin | 1001011100000000010… |
… | …0100110110101111111 |
3 | 120111111112220112012010 |
4 | 2113000010212311333 |
5 | 10124023333114403 |
6 | 202252341542303 |
7 | 14466613104621 |
oct | 2270004466577 |
9 | 514445815163 |
10 | 162136223103 |
11 | 628417421a8 |
12 | 2750b114993 |
13 | 1239b9cb16a |
14 | 7bc150cc11 |
15 | 433e2ac603 |
hex | 25c0126d7f |
162136223103 has 8 divisors (see below), whose sum is σ = 216185257008. Its totient is φ = 108089002304.
The previous prime is 162136223099. The next prime is 162136223149. The reversal of 162136223103 is 301322631261.
162136223103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 162136223103 - 22 = 162136223099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (162136223153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 228726 + ... + 613667.
It is an arithmetic number, because the mean of its divisors is an integer number (27023157126).
Almost surely, 2162136223103 is an apocalyptic number.
162136223103 is a deficient number, since it is larger than the sum of its proper divisors (54049033905).
162136223103 is an equidigital number, since it uses as much as digits as its factorization.
162136223103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 906553.
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 162136223103 its reverse (301322631261), we get a palindrome (463458854364).
The spelling of 162136223103 in words is "one hundred sixty-two billion, one hundred thirty-six million, two hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •