Base | Representation |
---|---|
bin | 1100000110001110100000… |
… | …1000001110101110111110 |
3 | 1202002120111110010222211002 |
4 | 3001203220020032232332 |
5 | 3220411134441020110 |
6 | 44142240321530302 |
7 | 2541654661630346 |
oct | 301435010165676 |
9 | 52076443128732 |
10 | 13301113220030 |
11 | 4268a74720749 |
12 | 15a9a17aa3992 |
13 | 75639c3160ac |
14 | 33dac4d47d26 |
15 | 180ed493daa5 |
hex | c18e820ebbe |
13301113220030 has 16 divisors (see below), whose sum is σ = 23942050869600. Its totient is φ = 5320434827232.
The previous prime is 13301113220027. The next prime is 13301113220069. The reversal of 13301113220030 is 3002231110331.
It is a super-2 number, since 2×133011132200302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13301113219984 and 13301113220011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5952092 + ... + 7875888.
It is an arithmetic number, because the mean of its divisors is an integer number (1496378179350).
Almost surely, 213301113220030 is an apocalyptic number.
13301113220030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13301113220030 is a deficient number, since it is larger than the sum of its proper divisors (10640937649570).
13301113220030 is a wasteful number, since it uses less digits than its factorization.
13301113220030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2615203.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13301113220030 its reverse (3002231110331), we get a palindrome (16303344330361).
The spelling of 13301113220030 in words is "thirteen trillion, three hundred one billion, one hundred thirteen million, two hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •