Base | Representation |
---|---|
bin | 1011111011001110000011… |
… | …1001000100001010001101 |
3 | 1201102111101202011211212220 |
4 | 2332303200321010022031 |
5 | 3204311400342234041 |
6 | 43515324205045553 |
7 | 2522211624431130 |
oct | 276634071041215 |
9 | 51374352154786 |
10 | 13112013243021 |
11 | 41a5856712110 |
12 | 15792428568b9 |
13 | 7415c42b8384 |
14 | 3348a6750217 |
15 | 17b1183aad66 |
hex | bece0e4428d |
13112013243021 has 32 divisors (see below), whose sum is σ = 22943782579200. Its totient is φ = 6452938846080.
The previous prime is 13112013243019. The next prime is 13112013243073. The reversal of 13112013243021 is 12034231021131.
It is not a de Polignac number, because 13112013243021 - 21 = 13112013243019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13112013242982 and 13112013243000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13112013243421) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1493731456 + ... + 1493740233.
It is an arithmetic number, because the mean of its divisors is an integer number (716993205600).
Almost surely, 213112013243021 is an apocalyptic number.
13112013243021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13112013243021 is a deficient number, since it is larger than the sum of its proper divisors (9831769336179).
13112013243021 is a wasteful number, since it uses less digits than its factorization.
13112013243021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2987471729.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13112013243021 its reverse (12034231021131), we get a palindrome (25146244264152).
The spelling of 13112013243021 in words is "thirteen trillion, one hundred twelve billion, thirteen million, two hundred forty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •