Base | Representation |
---|---|
bin | 110000000100010000… |
… | …1100100101110010001 |
3 | 100212102201211210022202 |
4 | 1200020201210232101 |
5 | 3142344342442001 |
6 | 115230350412545 |
7 | 10312641340505 |
oct | 1401041445621 |
9 | 325381753282 |
10 | 103222234001 |
11 | 3a85a295207 |
12 | 18008b01155 |
13 | 9970264493 |
14 | 4dd2d96305 |
15 | 2a4207a96b |
hex | 1808864b91 |
103222234001 has 4 divisors (see below), whose sum is σ = 103231672500. Its totient is φ = 103212795504.
The previous prime is 103222233977. The next prime is 103222234009. The reversal of 103222234001 is 100432222301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44415984001 + 58806250000 = 210751^2 + 242500^2 .
It is a cyclic number.
It is not a de Polignac number, because 103222234001 - 210 = 103222232977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103222234009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4702826 + ... + 4724723.
It is an arithmetic number, because the mean of its divisors is an integer number (25807918125).
Almost surely, 2103222234001 is an apocalyptic number.
It is an amenable number.
103222234001 is a deficient number, since it is larger than the sum of its proper divisors (9438499).
103222234001 is an equidigital number, since it uses as much as digits as its factorization.
103222234001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9438498.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 103222234001 its reverse (100432222301), we get a palindrome (203654456302).
The spelling of 103222234001 in words is "one hundred three billion, two hundred twenty-two million, two hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •