Base | Representation |
---|---|
bin | 1100000000011010000000… |
… | …1100011101110100010110 |
3 | 1201202000101220020222012010 |
4 | 3000012200030131310112 |
5 | 3212241344230414110 |
6 | 44024302313405050 |
7 | 2531515053422202 |
oct | 300064014356426 |
9 | 51660356228163 |
10 | 13201122123030 |
11 | 422a6233165a6 |
12 | 1592571109786 |
13 | 749b25602aca |
14 | 338d1b163b02 |
15 | 17d5d13b2020 |
hex | c01a031dd16 |
13201122123030 has 64 divisors (see below), whose sum is σ = 32709861900288. Its totient is φ = 3406205105280.
The previous prime is 13201122122983. The next prime is 13201122123073. The reversal of 13201122123030 is 3032122110231.
It is a junction number, because it is equal to n+sod(n) for n = 13201122122988 and 13201122123006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4813227 + ... + 7040553.
It is an arithmetic number, because the mean of its divisors is an integer number (511091592192).
Almost surely, 213201122123030 is an apocalyptic number.
13201122123030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13201122123030 is an abundant number, since it is smaller than the sum of its proper divisors (19508739777258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13201122123030 is a wasteful number, since it uses less digits than its factorization.
13201122123030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2233741.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13201122123030 its reverse (3032122110231), we get a palindrome (16233244233261).
The spelling of 13201122123030 in words is "thirteen trillion, two hundred one billion, one hundred twenty-two million, one hundred twenty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •