Base | Representation |
---|---|
bin | 1100000111100001001111… |
… | …1000100000011000101011 |
3 | 1202011200211020010121122200 |
4 | 3001320103320200120223 |
5 | 3221242130431211021 |
6 | 44200352155551243 |
7 | 2543402225362023 |
oct | 301702370403053 |
9 | 52150736117580 |
10 | 13323322132011 |
11 | 4277431006a61 |
12 | 15b219575b523 |
13 | 7584cb522928 |
14 | 340bd074aa83 |
15 | 181884587126 |
hex | c1e13e2062b |
13323322132011 has 24 divisors (see below), whose sum is σ = 19385861529216. Its totient is φ = 8817334479360.
The previous prime is 13323322131841. The next prime is 13323322132019. The reversal of 13323322132011 is 11023122332331.
13323322132011 is a `hidden beast` number, since 1 + 3 + 3 + 2 + 3 + 322 + 1 + 320 + 11 = 666.
It is not a de Polignac number, because 13323322132011 - 221 = 13323320034859 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13323322132019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8694400 + ... + 10111341.
It is an arithmetic number, because the mean of its divisors is an integer number (807744230384).
Almost surely, 213323322132011 is an apocalyptic number.
13323322132011 is a deficient number, since it is larger than the sum of its proper divisors (6062539397205).
13323322132011 is a wasteful number, since it uses less digits than its factorization.
13323322132011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18806323 (or 18806320 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 13323322132011 its reverse (11023122332331), we get a palindrome (24346444464342).
The spelling of 13323322132011 in words is "thirteen trillion, three hundred twenty-three billion, three hundred twenty-two million, one hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •