Base | Representation |
---|---|
bin | 1100010010000… |
… | …10110101110011 |
3 | 21011212200101111 |
4 | 12021002311303 |
5 | 202334043402 |
6 | 14120214151 |
7 | 2360530222 |
oct | 611026563 |
9 | 234780344 |
10 | 103034227 |
11 | 5318415a |
12 | 2a60a357 |
13 | 184668ca |
14 | d980cb9 |
15 | 90a39d7 |
hex | 6242d73 |
103034227 has 4 divisors (see below), whose sum is σ = 107514000. Its totient is φ = 98554456.
The previous prime is 103034213. The next prime is 103034257. The reversal of 103034227 is 722430301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 722430301 = 541 ⋅1335361.
It is a cyclic number.
It is not a de Polignac number, because 103034227 - 223 = 94645619 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103034198 and 103034207.
It is not an unprimeable number, because it can be changed into a prime (103034257) 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, 2239852 + ... + 2239897.
It is an arithmetic number, because the mean of its divisors is an integer number (26878500).
Almost surely, 2103034227 is an apocalyptic number.
103034227 is a deficient number, since it is larger than the sum of its proper divisors (4479773).
103034227 is an equidigital number, since it uses as much as digits as its factorization.
103034227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4479772.
The product of its (nonzero) digits is 1008, while the sum is 22.
The square root of 103034227 is about 10150.5776682906. The cubic root of 103034227 is about 468.8067315751.
Adding to 103034227 its reverse (722430301), we get a palindrome (825464528).
The spelling of 103034227 in words is "one hundred three million, thirty-four thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •