Base | Representation |
---|---|
bin | 1011111011110000010110… |
… | …1101111111110100000111 |
3 | 1201110101011110021001110122 |
4 | 2332330011231333310013 |
5 | 3204434230041030343 |
6 | 43523450012012155 |
7 | 2522656042363412 |
oct | 276740555776407 |
9 | 51411143231418 |
10 | 13121221033223 |
11 | 41a9751227186 |
12 | 157ab9246105b |
13 | 742430b1c744 |
14 | 3350db5b4b79 |
15 | 17b4a6930068 |
hex | bef05b7fd07 |
13121221033223 has 4 divisors (see below), whose sum is σ = 13224537734400. Its totient is φ = 13017904332048.
The previous prime is 13121221033163. The next prime is 13121221033279. The reversal of 13121221033223 is 32233012212131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13121221033223 - 26 = 13121221033159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13121221033192 and 13121221033201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13121221030223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51658350398 + ... + 51658350651.
It is an arithmetic number, because the mean of its divisors is an integer number (3306134433600).
Almost surely, 213121221033223 is an apocalyptic number.
13121221033223 is a deficient number, since it is larger than the sum of its proper divisors (103316701177).
13121221033223 is a wasteful number, since it uses less digits than its factorization.
13121221033223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103316701176.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13121221033223 its reverse (32233012212131), we get a palindrome (45354233245354).
The spelling of 13121221033223 in words is "thirteen trillion, one hundred twenty-one billion, two hundred twenty-one million, thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •