Base | Representation |
---|---|
bin | 1100000110010110101010… |
… | …1010011000100000010110 |
3 | 1202002210011002000001200212 |
4 | 3001211222222120200112 |
5 | 3220430131110223110 |
6 | 44143241513005422 |
7 | 2542063153351640 |
oct | 301455252304026 |
9 | 52083132001625 |
10 | 13303303211030 |
11 | 4269998934368 |
12 | 15aa3293b3872 |
13 | 75665ac51a61 |
14 | 33dc51b3b890 |
15 | 1810b1d2ee05 |
hex | c196aa98816 |
13303303211030 has 32 divisors (see below), whose sum is σ = 27949067421696. Its totient is φ = 4464087155424.
The previous prime is 13303303211027. The next prime is 13303303211041. The reversal of 13303303211030 is 3011230330331.
It is a super-2 number, since 2×133033032110302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13303303210987 and 13303303211005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2021775314 + ... + 2021781893.
It is an arithmetic number, because the mean of its divisors is an integer number (873408356928).
Almost surely, 213303303211030 is an apocalyptic number.
13303303211030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13303303211030 is an abundant number, since it is smaller than the sum of its proper divisors (14645764210666).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13303303211030 is a wasteful number, since it uses less digits than its factorization.
13303303211030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4043557268.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 13303303211030 its reverse (3011230330331), we get a palindrome (16314533541361).
The spelling of 13303303211030 in words is "thirteen trillion, three hundred three billion, three hundred three million, two hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •