Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0100110100000000000001 |
3 | 1201102100001110021000211201 |
4 | 2332301330210310000001 |
5 | 3204244424013243403 |
6 | 43514445203541201 |
7 | 2522122130053153 |
oct | 276617444640001 |
9 | 51370043230751 |
10 | 13110330212353 |
11 | 41a507268a280 |
12 | 1578a5308a801 |
13 | 7413b670093a |
14 | 334787004ad3 |
15 | 17b06a75a21d |
hex | bec7c934001 |
13110330212353 has 32 divisors (see below), whose sum is σ = 14597495377920. Its totient is φ = 11675248717440.
The previous prime is 13110330212323. The next prime is 13110330212359. The reversal of 13110330212353 is 35321203301131.
It is a happy number.
It is not a de Polignac number, because 13110330212353 - 29 = 13110330211841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13110330212359) 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 31 ways as a sum of consecutive naturals, for example, 50713300 + ... + 50971162.
It is an arithmetic number, because the mean of its divisors is an integer number (456171730560).
Almost surely, 213110330212353 is an apocalyptic number.
It is an amenable number.
13110330212353 is a deficient number, since it is larger than the sum of its proper divisors (1487165165567).
13110330212353 is a wasteful number, since it uses less digits than its factorization.
13110330212353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258429.
The product of its (nonzero) digits is 4860, while the sum is 28.
Adding to 13110330212353 its reverse (35321203301131), we get a palindrome (48431533513484).
The spelling of 13110330212353 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, two hundred twelve thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •