Base | Representation |
---|---|
bin | 1011111010100110001011… |
… | …1011100000110110101001 |
3 | 1201101110202211011211112201 |
4 | 2332221202323200312221 |
5 | 3204122440331133113 |
6 | 43510354141540201 |
7 | 2521352450515243 |
oct | 276514273406651 |
9 | 51343684154481 |
10 | 13101310021033 |
11 | 41a1263a58003 |
12 | 1577156274661 |
13 | 7405a9a01120 |
14 | 33416d055093 |
15 | 17abdd8e0cdd |
hex | bea62ee0da9 |
13101310021033 has 16 divisors (see below), whose sum is σ = 14187967533376. Its totient is φ = 12025927465920.
The previous prime is 13101310020991. The next prime is 13101310021057. The reversal of 13101310021033 is 33012001310131.
It is a cyclic number.
It is not a de Polignac number, because 13101310021033 - 217 = 13101309889961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13101310021033.
It is not an unprimeable number, because it can be changed into a prime (13101310021133) 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, 38105110 + ... + 38447392.
It is an arithmetic number, because the mean of its divisors is an integer number (886747970836).
Almost surely, 213101310021033 is an apocalyptic number.
13101310021033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
13101310021033 is a deficient number, since it is larger than the sum of its proper divisors (1086657512343).
13101310021033 is a wasteful number, since it uses less digits than its factorization.
13101310021033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 358744.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13101310021033 its reverse (33012001310131), we get a palindrome (46113311331164).
The spelling of 13101310021033 in words is "thirteen trillion, one hundred one billion, three hundred ten million, twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •