Base | Representation |
---|---|
bin | 1100000111100000001010… |
… | …1001101000101101111111 |
3 | 1202011200002002010021022222 |
4 | 3001320002221220231333 |
5 | 3221241032423140221 |
6 | 44200303351155555 |
7 | 2543362115104466 |
oct | 301700251505577 |
9 | 52150062107288 |
10 | 13323033021311 |
11 | 42772a289a8a2 |
12 | 15b2114975bbb |
13 | 758483668400 |
14 | 340ba41ad9dd |
15 | 181868ec99ab |
hex | c1e02a68b7f |
13323033021311 has 12 divisors (see below), whose sum is σ = 15275346599952. Its totient is φ = 11574761717376.
The previous prime is 13323033021307. The next prime is 13323033021341. The reversal of 13323033021311 is 11312033032331.
13323033021311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13323033021311 - 22 = 13323033021307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13323033021341) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2318659331 + ... + 2318665076.
It is an arithmetic number, because the mean of its divisors is an integer number (1272945549996).
Almost surely, 213323033021311 is an apocalyptic number.
13323033021311 is a deficient number, since it is larger than the sum of its proper divisors (1952313578641).
13323033021311 is a wasteful number, since it uses less digits than its factorization.
13323033021311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4637324450 (or 4637324437 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13323033021311 its reverse (11312033032331), we get a palindrome (24635066053642).
The spelling of 13323033021311 in words is "thirteen trillion, three hundred twenty-three billion, thirty-three million, twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •