Base | Representation |
---|---|
bin | 1011111110001100000110… |
… | …1110111111000110101101 |
3 | 1201121101002012102110021000 |
4 | 2333203001232333012231 |
5 | 3211130341202132413 |
6 | 43555002413430513 |
7 | 2525666104614342 |
oct | 277430156770655 |
9 | 51541065373230 |
10 | 13163030114733 |
11 | 4215456381a04 |
12 | 158710019b439 |
13 | 746364921825 |
14 | 3371461407c9 |
15 | 17c602166073 |
hex | bf8c1bbf1ad |
13163030114733 has 16 divisors (see below), whose sum is σ = 19701824383360. Its totient is φ = 8684885847168.
The previous prime is 13163030114693. The next prime is 13163030114771. The reversal of 13163030114733 is 33741103036131.
13163030114733 is a `hidden beast` number, since 1 + 3 + 1 + 630 + 3 + 0 + 1 + 14 + 7 + 3 + 3 = 666.
It is a de Polignac number, because none of the positive numbers 2k-13163030114733 is a prime.
It is a super-2 number, since 2×131630301147332 (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 (13163030114833) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2512985185 + ... + 2512990422.
It is an arithmetic number, because the mean of its divisors is an integer number (1231364023960).
Almost surely, 213163030114733 is an apocalyptic number.
It is an amenable number.
13163030114733 is a deficient number, since it is larger than the sum of its proper divisors (6538794268627).
13163030114733 is an equidigital number, since it uses as much as digits as its factorization.
13163030114733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5025975713 (or 5025975707 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 36.
The spelling of 13163030114733 in words is "thirteen trillion, one hundred sixty-three billion, thirty million, one hundred fourteen thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •