Base | Representation |
---|---|
bin | 1011111011000111111000… |
… | …0100100001101100100001 |
3 | 1201102100010012110210000101 |
4 | 2332301332010201230201 |
5 | 3204300001424200301 |
6 | 43514451501422401 |
7 | 2522122553244262 |
oct | 276617604415441 |
9 | 51370105423011 |
10 | 13110355303201 |
11 | 41a5085867412 |
12 | 1578a5b56aa01 |
13 | 7413bb9772b0 |
14 | 33478a496969 |
15 | 17b06ca64701 |
hex | bec7e121b21 |
13110355303201 has 16 divisors (see below), whose sum is σ = 14206125237696. Its totient is φ = 12027061020096.
The previous prime is 13110355303109. The next prime is 13110355303223. The reversal of 13110355303201 is 10230355301131.
It is a happy number.
13110355303201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13110355303201 - 233 = 13101765368609 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13110355303201.
It is not an unprimeable number, because it can be changed into a prime (13110355303601) 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, 49310046 + ... + 49575208.
It is an arithmetic number, because the mean of its divisors is an integer number (887882827356).
Almost surely, 213110355303201 is an apocalyptic number.
It is an amenable number.
13110355303201 is a deficient number, since it is larger than the sum of its proper divisors (1095769934495).
13110355303201 is a wasteful number, since it uses less digits than its factorization.
13110355303201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 288672.
The product of its (nonzero) digits is 4050, while the sum is 28.
The spelling of 13110355303201 in words is "thirteen trillion, one hundred ten billion, three hundred fifty-five million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •