Base | Representation |
---|---|
bin | 1011111010100101110110… |
… | …1000000010100110110000 |
3 | 1201101110112121201122020101 |
4 | 2332221131220002212300 |
5 | 3204122300040432240 |
6 | 43510341242322144 |
7 | 2521350320225143 |
oct | 276513550024660 |
9 | 51343477648211 |
10 | 13101221030320 |
11 | 41a12187a5a65 |
12 | 15771304b9354 |
13 | 7405944436b7 |
14 | 3341612cc05a |
15 | 17abd5bb339a |
hex | bea5da029b0 |
13101221030320 has 80 divisors (see below), whose sum is σ = 30498352489440. Its totient is φ = 5233951844352.
The previous prime is 13101221030279. The next prime is 13101221030327. The reversal of 13101221030320 is 2303012210131.
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (13101221030327) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 266710402 + ... + 266759518.
It is an arithmetic number, because the mean of its divisors is an integer number (381229406118).
Almost surely, 213101221030320 is an apocalyptic number.
13101221030320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13101221030320 is an abundant number, since it is smaller than the sum of its proper divisors (17397131459120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13101221030320 is a wasteful number, since it uses less digits than its factorization.
13101221030320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53222 (or 53216 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13101221030320 its reverse (2303012210131), we get a palindrome (15404233240451).
The spelling of 13101221030320 in words is "thirteen trillion, one hundred one billion, two hundred twenty-one million, thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •