Base | Representation |
---|---|
bin | 1100000110101111101010… |
… | …0110001111110000100111 |
3 | 1202010102110200200022200002 |
4 | 3001223322212033300213 |
5 | 3221032401312404111 |
6 | 44150311403211515 |
7 | 2542421346624620 |
oct | 301537246176047 |
9 | 52112420608602 |
10 | 13310013013031 |
11 | 4271821399979 |
12 | 15ab6a0516b9b |
13 | 75718a0ac5b7 |
14 | 3402cad16a47 |
15 | 181355e2463b |
hex | c1afa98fc27 |
13310013013031 has 16 divisors (see below), whose sum is σ = 16131282902784. Its totient is φ = 10720790377344.
The previous prime is 13310013013019. The next prime is 13310013013049. The reversal of 13310013013031 is 13031031001331.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13310013013031 is a prime.
It is a super-2 number, since 2×133100130130312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13310013012994 and 13310013013012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310013010031) 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, 86897705 + ... + 87050738.
It is an arithmetic number, because the mean of its divisors is an integer number (1008205181424).
Almost surely, 213310013013031 is an apocalyptic number.
13310013013031 is a deficient number, since it is larger than the sum of its proper divisors (2821269889753).
13310013013031 is a wasteful number, since it uses less digits than its factorization.
13310013013031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 173949110.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 13310013013031 its reverse (13031031001331), we get a palindrome (26341044014362).
The spelling of 13310013013031 in words is "thirteen trillion, three hundred ten billion, thirteen million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •