Base | Representation |
---|---|
bin | 1100000110110000011100… |
… | …1000011110000010110111 |
3 | 1202010110000100101120021220 |
4 | 3001230013020132002313 |
5 | 3221033314131423111 |
6 | 44150344314441423 |
7 | 2542426512262413 |
oct | 301540710360267 |
9 | 52113010346256 |
10 | 13310223311031 |
11 | 427191a075979 |
12 | 15ab73aa33273 |
13 | 7571c1830c9a |
14 | 34030ac19d43 |
15 | 181369614e06 |
hex | c1b0721e0b7 |
13310223311031 has 16 divisors (see below), whose sum is σ = 18297532810464. Its totient is φ = 8600064344064.
The previous prime is 13310223311029. The next prime is 13310223311041. The reversal of 13310223311031 is 13011332201331.
It is not a de Polignac number, because 13310223311031 - 21 = 13310223311029 is a prime.
It is a super-2 number, since 2×133102233110312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13310223310992 and 13310223311010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310223311041) 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, 233263150 + ... + 233320203.
It is an arithmetic number, because the mean of its divisors is an integer number (1143595800654).
Almost surely, 213310223311031 is an apocalyptic number.
13310223311031 is a deficient number, since it is larger than the sum of its proper divisors (4987309499433).
13310223311031 is a wasteful number, since it uses less digits than its factorization.
13310223311031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 466583650.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13310223311031 its reverse (13011332201331), we get a palindrome (26321555512362).
The spelling of 13310223311031 in words is "thirteen trillion, three hundred ten billion, two hundred twenty-three million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •