Base | Representation |
---|---|
bin | 1100000110110000000111… |
… | …0000010110010111001110 |
3 | 1202010102210001122110210210 |
4 | 3001230001300112113032 |
5 | 3221033123033231110 |
6 | 44150331333143250 |
7 | 2542424335436412 |
oct | 301540160262716 |
9 | 52112701573723 |
10 | 13310133102030 |
11 | 4271883161586 |
12 | 15ab71478ab26 |
13 | 7571a8c37b8b |
14 | 3402dcc56d42 |
15 | 181361746520 |
hex | c1b01c165ce |
13310133102030 has 64 divisors (see below), whose sum is σ = 32016070080000. Its totient is φ = 3541401751680.
The previous prime is 13310133102029. The next prime is 13310133102061. The reversal of 13310133102030 is 3020133101331.
It is a junction number, because it is equal to n+sod(n) for n = 13310133101988 and 13310133102006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41046471 + ... + 41369469.
It is an arithmetic number, because the mean of its divisors is an integer number (500251095000).
Almost surely, 213310133102030 is an apocalyptic number.
13310133102030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13310133102030 is an abundant number, since it is smaller than the sum of its proper divisors (18705936977970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13310133102030 is a wasteful number, since it uses less digits than its factorization.
13310133102030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326089.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13310133102030 its reverse (3020133101331), we get a palindrome (16330266203361).
The spelling of 13310133102030 in words is "thirteen trillion, three hundred ten billion, one hundred thirty-three million, one hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •