Base | Representation |
---|---|
bin | 1011110101010010110100… |
… | …0001001011001100110000 |
3 | 1201001202121222201100221202 |
4 | 2331110231001023030300 |
5 | 3201124403033103240 |
6 | 43400450350310332 |
7 | 2511646106511014 |
oct | 275245501131460 |
9 | 51052558640852 |
10 | 13010211222320 |
11 | 4166666072204 |
12 | 15615714b83a8 |
13 | 734b1c35bbc0 |
14 | 32d9aa24c544 |
15 | 17865ad69315 |
hex | bd52d04b330 |
13010211222320 has 80 divisors (see below), whose sum is σ = 33190200816192. Its totient is φ = 4713133102080.
The previous prime is 13010211222319. The next prime is 13010211222343. The reversal of 13010211222320 is 2322211201031.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 13010211222292 and 13010211222301.
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, 117962036 + ... + 118072275.
Almost surely, 213010211222320 is an apocalyptic number.
13010211222320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13010211222320 is an abundant number, since it is smaller than the sum of its proper divisors (20179989593872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13010211222320 is a wasteful number, since it uses less digits than its factorization.
13010211222320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236034390 (or 236034384 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 13010211222320 its reverse (2322211201031), we get a palindrome (15332422423351).
The spelling of 13010211222320 in words is "thirteen trillion, ten billion, two hundred eleven million, two hundred twenty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •