Base | Representation |
---|---|
bin | 110000001010001010… |
… | …0000111100110111101 |
3 | 100212221112001001011222 |
4 | 1200110110013212331 |
5 | 3143301012032334 |
6 | 115302134123125 |
7 | 10320562531364 |
oct | 1402424074675 |
9 | 325845031158 |
10 | 103420033469 |
11 | 3a950a04945 |
12 | 180631b04a5 |
13 | 99a222ac9c |
14 | 50113647db |
15 | 2a545ecd2e |
hex | 18145079bd |
103420033469 has 4 divisors (see below), whose sum is σ = 103438900896. Its totient is φ = 103401166044.
The previous prime is 103420033397. The next prime is 103420033471. The reversal of 103420033469 is 964330024301.
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 a de Polignac number, because none of the positive numbers 2k-103420033469 is a prime.
It is a super-2 number, since 2×1034200334692 (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 (103420033489) 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, 9425489 + ... + 9436454.
It is an arithmetic number, because the mean of its divisors is an integer number (25859725224).
Almost surely, 2103420033469 is an apocalyptic number.
It is an amenable number.
103420033469 is a deficient number, since it is larger than the sum of its proper divisors (18867427).
103420033469 is an equidigital number, since it uses as much as digits as its factorization.
103420033469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18867426.
The product of its (nonzero) digits is 46656, while the sum is 35.
The spelling of 103420033469 in words is "one hundred three billion, four hundred twenty million, thirty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •