Base | Representation |
---|---|
bin | 110000111101011110… |
… | …1110110101011101101 |
3 | 101001101112200201102121 |
4 | 1201322331312223231 |
5 | 3210312404001341 |
6 | 120145055152541 |
7 | 10411344244441 |
oct | 1417275665355 |
9 | 331345621377 |
10 | 105142250221 |
11 | 40655071878 |
12 | 18463b15751 |
13 | 9bb7c85958 |
14 | 5135d90821 |
15 | 2b058de4d1 |
hex | 187af76aed |
105142250221 has 4 divisors (see below), whose sum is σ = 108533935744. Its totient is φ = 101750564700.
The previous prime is 105142250201. The next prime is 105142250231. The reversal of 105142250221 is 122052241501.
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 105142250221 - 211 = 105142248173 is a prime.
It is a super-2 number, since 2×1051422502212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105142250201) 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, 1695842715 + ... + 1695842776.
It is an arithmetic number, because the mean of its divisors is an integer number (27133483936).
Almost surely, 2105142250221 is an apocalyptic number.
It is an amenable number.
105142250221 is a deficient number, since it is larger than the sum of its proper divisors (3391685523).
105142250221 is an equidigital number, since it uses as much as digits as its factorization.
105142250221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3391685522.
The product of its (nonzero) digits is 1600, while the sum is 25.
Adding to 105142250221 its reverse (122052241501), we get a palindrome (227194491722).
The spelling of 105142250221 in words is "one hundred five billion, one hundred forty-two million, two hundred fifty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •