Base | Representation |
---|---|
bin | 1100000001000110101001… |
… | …0100010011101101100010 |
3 | 1201210011022212121012221200 |
4 | 3000101222110103231202 |
5 | 3212440413344023020 |
6 | 44034003223502030 |
7 | 2532421004223255 |
oct | 300215224235542 |
9 | 51704285535850 |
10 | 13213103111010 |
11 | 4234711272160 |
12 | 15949555b7916 |
13 | 74acb483baca |
14 | 33973643309c |
15 | 17da83129590 |
hex | c046a513b62 |
13213103111010 has 48 divisors (see below), whose sum is σ = 37477165190400. Its totient is φ = 3203176511520.
The previous prime is 13213103111009. The next prime is 13213103111071. The reversal of 13213103111010 is 1011130131231.
13213103111010 is a `hidden beast` number, since 1 + 3 + 21 + 310 + 311 + 10 + 10 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6673283410 + ... + 6673285389.
It is an arithmetic number, because the mean of its divisors is an integer number (780774274800).
Almost surely, 213213103111010 is an apocalyptic number.
13213103111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13213103111010 is an abundant number, since it is smaller than the sum of its proper divisors (24264062079390).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213103111010 is a wasteful number, since it uses less digits than its factorization.
13213103111010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13346568823 (or 13346568820 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 13213103111010 its reverse (1011130131231), we get a palindrome (14224233242241).
The spelling of 13213103111010 in words is "thirteen trillion, two hundred thirteen billion, one hundred three million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •