Base | Representation |
---|---|
bin | 11110110010111101010… |
… | …101110010001011011101 |
3 | 21111022112121210002202000 |
4 | 132302331111302023131 |
5 | 234133140412422023 |
6 | 4300114240352513 |
7 | 305616620364030 |
oct | 36627525621335 |
9 | 7438477702660 |
10 | 2116300514013 |
11 | 746577517374 |
12 | 2a21a0915739 |
13 | 124749177a7a |
14 | 7460274b017 |
15 | 3a0b32be243 |
hex | 1ecbd5722dd |
2116300514013 has 16 divisors (see below), whose sum is σ = 3583154309760. Its totient is φ = 1209314579328.
The previous prime is 2116300514011. The next prime is 2116300514057. The reversal of 2116300514013 is 3104150036112.
It is a happy number.
2116300514013 is a `hidden beast` number, since 2 + 1 + 1 + 630 + 0 + 5 + 14 + 0 + 13 = 666.
It is not a de Polignac number, because 2116300514013 - 21 = 2116300514011 is a prime.
It is a super-2 number, since 2×21163005140132 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2116300514011) 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, 5598678420 + ... + 5598678797.
It is an arithmetic number, because the mean of its divisors is an integer number (223947144360).
Almost surely, 22116300514013 is an apocalyptic number.
It is an amenable number.
2116300514013 is a deficient number, since it is larger than the sum of its proper divisors (1466853795747).
2116300514013 is a wasteful number, since it uses less digits than its factorization.
2116300514013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11197357233 (or 11197357227 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 2116300514013 in words is "two trillion, one hundred sixteen billion, three hundred million, five hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •