Base | Representation |
---|---|
bin | 110000000100010101… |
… | …0010011000111110111 |
3 | 100212102220010222210002 |
4 | 1200020222103013313 |
5 | 3142400434134312 |
6 | 115230511421515 |
7 | 10312666644653 |
oct | 1401052230767 |
9 | 325386128702 |
10 | 103224521207 |
11 | 3a860607665 |
12 | 1800982489b |
13 | 9970885562 |
14 | 4dd33cda63 |
15 | 2a4237d4c2 |
hex | 1808a931f7 |
103224521207 has 4 divisors (see below), whose sum is σ = 103319485056. Its totient is φ = 103129557360.
The previous prime is 103224521161. The next prime is 103224521227. The reversal of 103224521207 is 702125422301.
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 103224521207 - 212 = 103224517111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103224521207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103224521227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47480294 + ... + 47482467.
It is an arithmetic number, because the mean of its divisors is an integer number (25829871264).
Almost surely, 2103224521207 is an apocalyptic number.
103224521207 is a deficient number, since it is larger than the sum of its proper divisors (94963849).
103224521207 is an equidigital number, since it uses as much as digits as its factorization.
103224521207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94963848.
The product of its (nonzero) digits is 6720, while the sum is 29.
Adding to 103224521207 its reverse (702125422301), we get a palindrome (805349943508).
The spelling of 103224521207 in words is "one hundred three billion, two hundred twenty-four million, five hundred twenty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •