Base | Representation |
---|---|
bin | 1100000111111010111100… |
… | …0011111011101001010111 |
3 | 1202012100121222202012222212 |
4 | 3001332233003323221113 |
5 | 3221400242431004111 |
6 | 44203452505144035 |
7 | 2544035202152561 |
oct | 301765703735127 |
9 | 52170558665885 |
10 | 13330220563031 |
11 | 427a350a98319 |
12 | 15b359ba8b01b |
13 | 75905a785b88 |
14 | 3412869c8331 |
15 | 181b39edb98b |
hex | c1faf0fba57 |
13330220563031 has 4 divisors (see below), whose sum is σ = 14031811119000. Its totient is φ = 12628630007064.
The previous prime is 13330220562977. The next prime is 13330220563043. The reversal of 13330220563031 is 13036502203331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13330220563031 is a prime.
It is a super-2 number, since 2×133302205630312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330220563091) 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, 350795277956 + ... + 350795277993.
It is an arithmetic number, because the mean of its divisors is an integer number (3507952779750).
Almost surely, 213330220563031 is an apocalyptic number.
13330220563031 is a deficient number, since it is larger than the sum of its proper divisors (701590555969).
13330220563031 is an equidigital number, since it uses as much as digits as its factorization.
13330220563031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701590555968.
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 13330220563031 its reverse (13036502203331), we get a palindrome (26366722766362).
The spelling of 13330220563031 in words is "thirteen trillion, three hundred thirty billion, two hundred twenty million, five hundred sixty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •