Base | Representation |
---|---|
bin | 1100000110110011110000… |
… | …0111101100010111100010 |
3 | 1202010112022022011212220100 |
4 | 3001230330013230113202 |
5 | 3221042124222100002 |
6 | 44151012432523230 |
7 | 2542460525461116 |
oct | 301547407542742 |
9 | 52115268155810 |
10 | 13311112300002 |
11 | 4272235967500 |
12 | 15ab9486b0516 |
13 | 757303a7086a |
14 | 340392d0b746 |
15 | 1813bc6b911c |
hex | c1b3c1ec5e2 |
13311112300002 has 36 divisors (see below), whose sum is σ = 31700982328470. Its totient is φ = 4033670393280.
The previous prime is 13311112300001. The next prime is 13311112300007. The reversal of 13311112300002 is 20000321111331.
13311112300002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 12518583261921 + 792529038081 = 3538161^2 + 890241^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (13311112300001) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3055808727 + ... + 3055813082.
Almost surely, 213311112300002 is an apocalyptic number.
13311112300002 is an abundant number, since it is smaller than the sum of its proper divisors (18389870028468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13311112300002 is a wasteful number, since it uses less digits than its factorization.
13311112300002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6111621839 (or 6111621825 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13311112300002 its reverse (20000321111331), we get a palindrome (33311433411333).
The spelling of 13311112300002 in words is "thirteen trillion, three hundred eleven billion, one hundred twelve million, three hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •