Base | Representation |
---|---|
bin | 1100000110001011100101… |
… | …1100111111011110011010 |
3 | 1202002111110212122001220122 |
4 | 3001202321130333132122 |
5 | 3220403034003232102 |
6 | 44142030505353242 |
7 | 2541626402536064 |
oct | 301427134773632 |
9 | 52074425561818 |
10 | 13300330133402 |
11 | 4268702692114 |
12 | 15a9839798822 |
13 | 7562a6005720 |
14 | 33da4cd42734 |
15 | 180e8ad080a2 |
hex | c18b973f79a |
13300330133402 has 8 divisors (see below), whose sum is σ = 21485148677076. Its totient is φ = 6138613907712.
The previous prime is 13300330133401. The next prime is 13300330133411. The reversal of 13300330133402 is 20433103300331.
It can be written as a sum of positive squares in 2 ways, for example, as 11660524392001 + 1639805741401 = 3414751^2 + 1280549^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 511551158977 = 13300330133402 / (1 + 3 + 3 + 0 + 0 + 3 + 3 + 0 + 1 + 3 + 3 + 4 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (13300330133401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255775579463 + ... + 255775579514.
Almost surely, 213300330133402 is an apocalyptic number.
13300330133402 is a deficient number, since it is larger than the sum of its proper divisors (8184818543674).
13300330133402 is a wasteful number, since it uses less digits than its factorization.
13300330133402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511551158992.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 13300330133402 its reverse (20433103300331), we get a palindrome (33733433433733).
The spelling of 13300330133402 in words is "thirteen trillion, three hundred billion, three hundred thirty million, one hundred thirty-three thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •