Base | Representation |
---|---|
bin | 101111000011101000… |
… | …0001011001101000011 |
3 | 100122211120211020002000 |
4 | 1132013100023031003 |
5 | 3123424133142123 |
6 | 114231233155043 |
7 | 10205124554664 |
oct | 1360720131503 |
9 | 318746736060 |
10 | 101053412163 |
11 | 39947020270 |
12 | 177026bba83 |
13 | 96b5b2b152 |
14 | 4c68d1336b |
15 | 296696bb43 |
hex | 178740b343 |
101053412163 has 64 divisors (see below), whose sum is σ = 164164492800. Its totient is φ = 60928174080.
The previous prime is 101053412143. The next prime is 101053412219. The reversal of 101053412163 is 361214350101.
It is a happy number.
101053412163 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 534 + 121 + 6 + 3 = 666.
It is not a de Polignac number, because 101053412163 - 221 = 101051315011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (101053412143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 84704695 + ... + 84705887.
It is an arithmetic number, because the mean of its divisors is an integer number (2565070200).
Almost surely, 2101053412163 is an apocalyptic number.
101053412163 is a deficient number, since it is larger than the sum of its proper divisors (63111080637).
101053412163 is a wasteful number, since it uses less digits than its factorization.
101053412163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2449 (or 2443 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 101053412163 its reverse (361214350101), we get a palindrome (462267762264).
The spelling of 101053412163 in words is "one hundred one billion, fifty-three million, four hundred twelve thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •