Base | Representation |
---|---|
bin | 100101000100000000100000… |
… | …000001011000111101111001 |
3 | 210101010221120211000022211100 |
4 | 211010000200001120331321 |
5 | 132331120410312144423 |
6 | 1334402335033122013 |
7 | 46222405444432056 |
oct | 4504004001307571 |
9 | 711127524008740 |
10 | 163003136053113 |
11 | 47a35272901094 |
12 | 16347124559309 |
13 | 6cc518c163555 |
14 | 2c37572b4202d |
15 | 13ca144082343 |
hex | 944020058f79 |
163003136053113 has 24 divisors (see below), whose sum is σ = 235983197265920. Its totient is φ = 108422445438720.
The previous prime is 163003136053103. The next prime is 163003136053139. The reversal of 163003136053113 is 311350631300361.
163003136053113 is a `hidden beast` number, since 1 + 6 + 3 + 0 + 0 + 3 + 1 + 3 + 605 + 31 + 13 = 666.
It is not a de Polignac number, because 163003136053113 - 25 = 163003136053081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (163003136053103) 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 23 ways as a sum of consecutive naturals, for example, 2773633 + ... + 18267438.
Almost surely, 2163003136053113 is an apocalyptic number.
It is an amenable number.
163003136053113 is a deficient number, since it is larger than the sum of its proper divisors (72980061212807).
163003136053113 is a wasteful number, since it uses less digits than its factorization.
163003136053113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21043029 (or 21043026 counting only the distinct ones).
The product of its (nonzero) digits is 43740, while the sum is 36.
Adding to 163003136053113 its reverse (311350631300361), we get a palindrome (474353767353474).
The spelling of 163003136053113 in words is "one hundred sixty-three trillion, three billion, one hundred thirty-six million, fifty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •