Base | Representation |
---|---|
bin | 1011111011010010100011… |
… | …1100001010000100010000 |
3 | 1201102121111222200201211210 |
4 | 2332310220330022010100 |
5 | 3204321334313410300 |
6 | 43520044145140120 |
7 | 2522253603004341 |
oct | 276645074120420 |
9 | 51377458621753 |
10 | 13113222013200 |
11 | 41a6316a69031 |
12 | 157951b62a640 |
13 | 7417578606ba |
14 | 33497d0c40c8 |
15 | 17b18957a050 |
hex | bed28f0a110 |
13113222013200 has 120 divisors (see below), whose sum is σ = 42007609296288. Its totient is φ = 3496726999040.
The previous prime is 13113222013163. The next prime is 13113222013201. The reversal of 13113222013200 is 231022231131.
It is a tau number, because it is divible by the number of its divisors (120).
It is not an unprimeable number, because it can be changed into a prime (13113222013201) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 33891232 + ... + 34275968.
Almost surely, 213113222013200 is an apocalyptic number.
13113222013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13113222013200 is an abundant number, since it is smaller than the sum of its proper divisors (28894387283088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13113222013200 is a wasteful number, since it uses less digits than its factorization.
13113222013200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413161 (or 413150 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13113222013200 its reverse (231022231131), we get a palindrome (13344244244331).
The spelling of 13113222013200 in words is "thirteen trillion, one hundred thirteen billion, two hundred twenty-two million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •