Base | Representation |
---|---|
bin | 1100000111011101000100… |
… | …0100100010000110101110 |
3 | 1202011120221002220221112011 |
4 | 3001313101010202012232 |
5 | 3221232332002230220 |
6 | 44200045034431434 |
7 | 2543332364613445 |
oct | 301672104420656 |
9 | 52146832827464 |
10 | 13322201211310 |
11 | 4276a06302712 |
12 | 15b1b2229257a |
13 | 758380228744 |
14 | 340b25923d5c |
15 | 18181ae6c65a |
hex | c1dd11221ae |
13322201211310 has 8 divisors (see below), whose sum is σ = 23979962180376. Its totient is φ = 5328880484520.
The previous prime is 13322201211287. The next prime is 13322201211323. The reversal of 13322201211310 is 1311210222331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×133222012113102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 666110060556 + ... + 666110060575.
It is an arithmetic number, because the mean of its divisors is an integer number (2997495272547).
Almost surely, 213322201211310 is an apocalyptic number.
13322201211310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13322201211310 is a deficient number, since it is larger than the sum of its proper divisors (10657760969066).
13322201211310 is a wasteful number, since it uses less digits than its factorization.
13322201211310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332220121138.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13322201211310 its reverse (1311210222331), we get a palindrome (14633411433641).
The spelling of 13322201211310 in words is "thirteen trillion, three hundred twenty-two billion, two hundred one million, two hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •