Base | Representation |
---|---|
bin | 1100000110001011011111… |
… | …0010001010111110101010 |
3 | 1202002111101220221101222212 |
4 | 3001202313302022332222 |
5 | 3220403004321143424 |
6 | 44142024025245122 |
7 | 2541625612530545 |
oct | 301426762127652 |
9 | 52074356841885 |
10 | 13300302131114 |
11 | 42686988a6629 |
12 | 15a98303337a2 |
13 | 7562a027cb1b |
14 | 33da4933385c |
15 | 180e8862610e |
hex | c18b7c8afaa |
13300302131114 has 64 divisors (see below), whose sum is σ = 20697488491680. Its totient is φ = 6405665280000.
The previous prime is 13300302131113. The next prime is 13300302131167. The reversal of 13300302131114 is 41113120300331.
It can be written as a sum of positive squares in 16 ways, for example, as 208807872025 + 13091494259089 = 456955^2 + 3618217^2 .
It is a super-2 number, since 2×133003021311142 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13300302131114.
It is not an unprimeable number, because it can be changed into a prime (13300302131113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7728239774 + ... + 7728241494.
Almost surely, 213300302131114 is an apocalyptic number.
13300302131114 is a deficient number, since it is larger than the sum of its proper divisors (7397186360566).
13300302131114 is a wasteful number, since it uses less digits than its factorization.
13300302131114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3947.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13300302131114 its reverse (41113120300331), we get a palindrome (54413422431445).
The spelling of 13300302131114 in words is "thirteen trillion, three hundred billion, three hundred two million, one hundred thirty-one thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •