Base | Representation |
---|---|
bin | 1100000000111110110100… |
… | …0101111110001111000110 |
3 | 1201202221220110100221020221 |
4 | 3000033231011332033012 |
5 | 3212422113030413110 |
6 | 44033014534014554 |
7 | 2532314643616264 |
oct | 300175505761706 |
9 | 51687813327227 |
10 | 13211002201030 |
11 | 4233833372417 |
12 | 1594469aa745a |
13 | 74aa3b4c29ca |
14 | 3395b73cb434 |
15 | 17d9ad9827da |
hex | c03ed17e3c6 |
13211002201030 has 32 divisors (see below), whose sum is σ = 24136135107840. Its totient is φ = 5205767992800.
The previous prime is 13211002201003. The next prime is 13211002201049. The reversal of 13211002201030 is 3010220011231.
It is a junction number, because it is equal to n+sod(n) for n = 13211002200995 and 13211002201013.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 34296546 + ... + 34679605.
It is an arithmetic number, because the mean of its divisors is an integer number (754254222120).
Almost surely, 213211002201030 is an apocalyptic number.
13211002201030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13211002201030 is a deficient number, since it is larger than the sum of its proper divisors (10925132906810).
13211002201030 is a wasteful number, since it uses less digits than its factorization.
13211002201030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68976444.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13211002201030 its reverse (3010220011231), we get a palindrome (16221222212261).
The spelling of 13211002201030 in words is "thirteen trillion, two hundred eleven billion, two million, two hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •