Base | Representation |
---|---|
bin | 1011111010101001100101… |
… | …0011001100110110101001 |
3 | 1201101120010101121100011112 |
4 | 2332222121103030312221 |
5 | 3204131322340401413 |
6 | 43511024445040105 |
7 | 2521414165100645 |
oct | 276523123146651 |
9 | 51346111540145 |
10 | 13102222200233 |
11 | 41a1691948811 |
12 | 157736b856035 |
13 | 7406c39a022a |
14 | 334218261c25 |
15 | 17ac43a262a8 |
hex | bea994ccda9 |
13102222200233 has 8 divisors (see below), whose sum is σ = 13268280929280. Its totient is φ = 12936168666720.
The previous prime is 13102222200181. The next prime is 13102222200247. The reversal of 13102222200233 is 33200222220131.
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 13102222200233 - 26 = 13102222200169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13102222200199 and 13102222200208.
It is not an unprimeable number, because it can be changed into a prime (13102222200533) 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, 3908168 + ... + 6440358.
It is an arithmetic number, because the mean of its divisors is an integer number (1658535116160).
Almost surely, 213102222200233 is an apocalyptic number.
It is an amenable number.
13102222200233 is a deficient number, since it is larger than the sum of its proper divisors (166058729047).
13102222200233 is an equidigital number, since it uses as much as digits as its factorization.
13102222200233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2597767.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 13102222200233 its reverse (33200222220131), we get a palindrome (46302444420364).
The spelling of 13102222200233 in words is "thirteen trillion, one hundred two billion, two hundred twenty-two million, two hundred thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •