Base | Representation |
---|---|
bin | 10111011101110000100000… |
… | …101010111101101111001001 |
3 | 111112101211021222212120102110 |
4 | 113131300200222331233021 |
5 | 102011312121203301441 |
6 | 1003253234042452533 |
7 | 30510645521113404 |
oct | 2735604052755711 |
9 | 445354258776373 |
10 | 103200022322121 |
11 | 2a97897a1aaa8a |
12 | b6a8a32804149 |
13 | 45779497ac36a |
14 | 1b6ac9cb5ad3b |
15 | bde7093e6b16 |
hex | 5ddc20abdbc9 |
103200022322121 has 4 divisors (see below), whose sum is σ = 137600029762832. Its totient is φ = 68800014881412.
The previous prime is 103200022322099. The next prime is 103200022322153. The reversal of 103200022322121 is 121223220002301.
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 not a de Polignac number, because 103200022322121 - 29 = 103200022321609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103200022322821) 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, 17200003720351 + ... + 17200003720356.
It is an arithmetic number, because the mean of its divisors is an integer number (34400007440708).
Almost surely, 2103200022322121 is an apocalyptic number.
It is an amenable number.
103200022322121 is a deficient number, since it is larger than the sum of its proper divisors (34400007440711).
103200022322121 is an equidigital number, since it uses as much as digits as its factorization.
103200022322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34400007440710.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 103200022322121 its reverse (121223220002301), we get a palindrome (224423242324422).
The spelling of 103200022322121 in words is "one hundred three trillion, two hundred billion, twenty-two million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •