Base | Representation |
---|---|
bin | 1011110101010110001000… |
… | …1011000101000110100001 |
3 | 1201001211221010202221100202 |
4 | 2331111202023011012201 |
5 | 3201133214332324413 |
6 | 43401115044354545 |
7 | 2512010155550465 |
oct | 275254213050641 |
9 | 51054833687322 |
10 | 13011103011233 |
11 | 4166a834a6438 |
12 | 15617800a5a55 |
13 | 734c3203c052 |
14 | 32da5286c4a5 |
15 | 1786ae2c2e58 |
hex | bd5622c51a1 |
13011103011233 has 8 divisors (see below), whose sum is σ = 13013314326888. Its totient is φ = 13008891890304.
The previous prime is 13011103011227. The next prime is 13011103011259. The reversal of 13011103011233 is 33211030111031.
It can be written as a sum of positive squares in 4 ways, for example, as 638388216064 + 12372714795169 = 798992^2 + 3517487^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13011103011233 - 24 = 13011103011217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13011103011223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192914885 + ... + 192982317.
It is an arithmetic number, because the mean of its divisors is an integer number (1626664290861).
Almost surely, 213011103011233 is an apocalyptic number.
It is an amenable number.
13011103011233 is a deficient number, since it is larger than the sum of its proper divisors (2211315655).
13011103011233 is an equidigital number, since it uses as much as digits as its factorization.
13011103011233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97363.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 13011103011233 its reverse (33211030111031), we get a palindrome (46222133122264).
The spelling of 13011103011233 in words is "thirteen trillion, eleven billion, one hundred three million, eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •