Base | Representation |
---|---|
bin | 1100000110111011101001… |
… | …1110110110101111100111 |
3 | 1202010201210001100002120222 |
4 | 3001232322132312233213 |
5 | 3221110444432113111 |
6 | 44152003043514555 |
7 | 2542564210260125 |
oct | 301567236665747 |
9 | 52121701302528 |
10 | 13313232301031 |
11 | 4273123616673 |
12 | 15b023a688a5b |
13 | 757581042440 |
14 | 3405146c2915 |
15 | 1814938827db |
hex | c1bba7b6be7 |
13313232301031 has 8 divisors (see below), whose sum is σ = 14391841648800. Its totient is φ = 12242410746912.
The previous prime is 13313232301009. The next prime is 13313232301049. The reversal of 13313232301031 is 13010323231331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13313232301031 - 226 = 13313165192167 is a prime.
It is a super-2 number, since 2×133132323010312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13313232301091) 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, 1946944856 + ... + 1946951693.
It is an arithmetic number, because the mean of its divisors is an integer number (1798980206100).
Almost surely, 213313232301031 is an apocalyptic number.
13313232301031 is a deficient number, since it is larger than the sum of its proper divisors (1078609347769).
13313232301031 is a wasteful number, since it uses less digits than its factorization.
13313232301031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3893896825.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13313232301031 its reverse (13010323231331), we get a palindrome (26323555532362).
The spelling of 13313232301031 in words is "thirteen trillion, three hundred thirteen billion, two hundred thirty-two million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •