Base | Representation |
---|---|
bin | 1011111010100001011000… |
… | …0110110101100111001101 |
3 | 1201101100102222221002122210 |
4 | 2332220112012311213031 |
5 | 3204112320403102023 |
6 | 43510022220501033 |
7 | 2521305510322266 |
oct | 276502606654715 |
9 | 51340388832583 |
10 | 13100021144013 |
11 | 41a0762467691 |
12 | 1576a566aa779 |
13 | 74043298bbbb |
14 | 334089bcb96d |
15 | 17ab6569b593 |
hex | bea161b59cd |
13100021144013 has 8 divisors (see below), whose sum is σ = 17466888122848. Its totient is φ = 8733250797264.
The previous prime is 13100021143933. The next prime is 13100021144033. The reversal of 13100021144013 is 31044112000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13100021144013 - 29 = 13100021143501 is a prime.
It is a super-2 number, since 2×131000211440132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100021144033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23841106 + ... + 24384387.
It is an arithmetic number, because the mean of its divisors is an integer number (2183361015356).
Almost surely, 213100021144013 is an apocalyptic number.
It is an amenable number.
13100021144013 is a deficient number, since it is larger than the sum of its proper divisors (4366866978835).
13100021144013 is an equidigital number, since it uses as much as digits as its factorization.
13100021144013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48316043.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 13100021144013 its reverse (31044112000131), we get a palindrome (44144133144144).
The spelling of 13100021144013 in words is "thirteen trillion, one hundred billion, twenty-one million, one hundred forty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •