Base | Representation |
---|---|
bin | 1100000111011100101110… |
… | …1100011111101110001010 |
3 | 1202011120200211012221210210 |
4 | 3001313023230133232022 |
5 | 3221232140410232020 |
6 | 44200032053421550 |
7 | 2543330221210635 |
oct | 301671354375612 |
9 | 52146624187723 |
10 | 13322111024010 |
11 | 427696a403658 |
12 | 15b1ab803a8b6 |
13 | 75836763c489 |
14 | 340b17968c1c |
15 | 1818130a53e0 |
hex | c1dcbb1fb8a |
13322111024010 has 16 divisors (see below), whose sum is σ = 31973066457696. Its totient is φ = 3552562939728.
The previous prime is 13322111024003. The next prime is 13322111024017. The reversal of 13322111024010 is 1042011122331.
It is an interprime number because it is at equal distance from previous prime (13322111024003) and next prime (13322111024017).
It is not an unprimeable number, because it can be changed into a prime (13322111024017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 222035183704 + ... + 222035183763.
It is an arithmetic number, because the mean of its divisors is an integer number (1998316653606).
Almost surely, 213322111024010 is an apocalyptic number.
13322111024010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13322111024010 is an abundant number, since it is smaller than the sum of its proper divisors (18650955433686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13322111024010 is a wasteful number, since it uses less digits than its factorization.
13322111024010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444070367477.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 13322111024010 its reverse (1042011122331), we get a palindrome (14364122146341).
The spelling of 13322111024010 in words is "thirteen trillion, three hundred twenty-two billion, one hundred eleven million, twenty-four thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •