Base | Representation |
---|---|
bin | 1100010100001… |
… | …10101010100001 |
3 | 21012101210110121 |
4 | 12022012222201 |
5 | 202421441113 |
6 | 14130200241 |
7 | 2363065156 |
oct | 612065241 |
9 | 235353417 |
10 | 103312033 |
11 | 53353950 |
12 | 2a723081 |
13 | 185331a6 |
14 | da1422d |
15 | 910ae8d |
hex | 6286aa1 |
103312033 has 4 divisors (see below), whose sum is σ = 112704048. Its totient is φ = 93920020.
The previous prime is 103312019. The next prime is 103312037. The reversal of 103312033 is 330213301.
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 103312033 - 225 = 69757601 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103311998 and 103312016.
It is not an unprimeable number, because it can be changed into a prime (103312037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4695991 + ... + 4696012.
It is an arithmetic number, because the mean of its divisors is an integer number (28176012).
Almost surely, 2103312033 is an apocalyptic number.
It is an amenable number.
103312033 is a deficient number, since it is larger than the sum of its proper divisors (9392015).
103312033 is an equidigital number, since it uses as much as digits as its factorization.
103312033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9392014.
The product of its (nonzero) digits is 162, while the sum is 16.
The square root of 103312033 is about 10164.2527024863. The cubic root of 103312033 is about 469.2276934597.
Adding to 103312033 its reverse (330213301), we get a palindrome (433525334).
The spelling of 103312033 in words is "one hundred three million, three hundred twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •