Base | Representation |
---|---|
bin | 1011001000001100110111… |
… | …1000111101101100011101 |
3 | 1121022201000111121200220220 |
4 | 2302003031320331230131 |
5 | 3100431321401333203 |
6 | 42004530521031553 |
7 | 2401662422345136 |
oct | 262031570755435 |
9 | 47281014550826 |
10 | 12235521121053 |
11 | 3998067769a9a |
12 | 14573ab3255b9 |
13 | 6a9a5cba1289 |
14 | 3042b949cc8d |
15 | 163419a61653 |
hex | b20cde3db1d |
12235521121053 has 4 divisors (see below), whose sum is σ = 16314028161408. Its totient is φ = 8157014080700.
The previous prime is 12235521121003. The next prime is 12235521121067. The reversal of 12235521121053 is 35012112553221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12235521121053 - 26 = 12235521120989 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12235521121003) 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, 2039253520173 + ... + 2039253520178.
It is an arithmetic number, because the mean of its divisors is an integer number (4078507040352).
Almost surely, 212235521121053 is an apocalyptic number.
It is an amenable number.
12235521121053 is a deficient number, since it is larger than the sum of its proper divisors (4078507040355).
12235521121053 is an equidigital number, since it uses as much as digits as its factorization.
12235521121053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4078507040354.
The product of its (nonzero) digits is 18000, while the sum is 33.
Adding to 12235521121053 its reverse (35012112553221), we get a palindrome (47247633674274).
The spelling of 12235521121053 in words is "twelve trillion, two hundred thirty-five billion, five hundred twenty-one million, one hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •