Base | Representation |
---|---|
bin | 1100000110110000011010… |
… | …0001001011001001101111 |
3 | 1202010102222122000012222101 |
4 | 3001230012201023021233 |
5 | 3221033304012310111 |
6 | 44150343305555531 |
7 | 2542426325600350 |
oct | 301540641131157 |
9 | 52112878005871 |
10 | 13310213010031 |
11 | 427191427a653 |
12 | 15ab7374a5ba7 |
13 | 7571bc665412 |
14 | 3403096d7d27 |
15 | 18136877cbc1 |
hex | c1b0684b26f |
13310213010031 has 32 divisors (see below), whose sum is σ = 15719935610880. Its totient is φ = 11028386995200.
The previous prime is 13310213009999. The next prime is 13310213010053. The reversal of 13310213010031 is 13001031201331.
It is not a de Polignac number, because 13310213010031 - 25 = 13310213009999 is a prime.
It is a super-2 number, since 2×133102130100312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13310213009990 and 13310213010008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310213011031) 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, 807601311 + ... + 807617791.
It is an arithmetic number, because the mean of its divisors is an integer number (491247987840).
Almost surely, 213310213010031 is an apocalyptic number.
13310213010031 is a deficient number, since it is larger than the sum of its proper divisors (2409722600849).
13310213010031 is a wasteful number, since it uses less digits than its factorization.
13310213010031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20455.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13310213010031 its reverse (13001031201331), we get a palindrome (26311244211362).
The spelling of 13310213010031 in words is "thirteen trillion, three hundred ten billion, two hundred thirteen million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •