Base | Representation |
---|---|
bin | 1011111100011100101001… |
… | …1110011110101000111011 |
3 | 1201111111212011020022212221 |
4 | 2333013022132132220323 |
5 | 3210133103133330243 |
6 | 43533133544544511 |
7 | 2523556521131143 |
oct | 277071236365073 |
9 | 51444764208787 |
10 | 13133112011323 |
11 | 42037a3395007 |
12 | 1581350782137 |
13 | 7435a7502165 |
14 | 335908933923 |
15 | 17b950817bed |
hex | bf1ca79ea3b |
13133112011323 has 16 divisors (see below), whose sum is σ = 13641090742080. Its totient is φ = 12633218611200.
The previous prime is 13133112011321. The next prime is 13133112011417. The reversal of 13133112011323 is 32311021133131.
It is a cyclic number.
It is not a de Polignac number, because 13133112011323 - 21 = 13133112011321 is a prime.
It is a super-2 number, since 2×131331120113232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13133112011321) 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, 30844843 + ... + 31267723.
It is an arithmetic number, because the mean of its divisors is an integer number (852568171380).
Almost surely, 213133112011323 is an apocalyptic number.
13133112011323 is a deficient number, since it is larger than the sum of its proper divisors (507978730757).
13133112011323 is an equidigital number, since it uses as much as digits as its factorization.
13133112011323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432438.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 13133112011323 its reverse (32311021133131), we get a palindrome (45444133144454).
The spelling of 13133112011323 in words is "thirteen trillion, one hundred thirty-three billion, one hundred twelve million, eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •