Base | Representation |
---|---|
bin | 101111111110001111… |
… | …1010000101011000101 |
3 | 100211220122212112022121 |
4 | 1133330133100223011 |
5 | 3141441144112442 |
6 | 115154334325541 |
7 | 10304640052525 |
oct | 1377437205305 |
9 | 324818775277 |
10 | 103020300997 |
11 | 3a766301a29 |
12 | 17b713598b1 |
13 | 993a4813b3 |
14 | 4db422d685 |
15 | 2a2e48d967 |
hex | 17fc7d0ac5 |
103020300997 has 4 divisors (see below), whose sum is σ = 104324355520. Its totient is φ = 101716246476.
The previous prime is 103020300967. The next prime is 103020301031. The reversal of 103020300997 is 799003020301.
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, and also an emirpimes, since its reverse is a distinct semiprime: 799003020301 = 449 ⋅1779516749.
It is a cyclic number.
It is not a de Polignac number, because 103020300997 - 227 = 102886083269 is a prime.
It is a super-2 number, since 2×1030203009972 (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 (103020300907) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 652027143 + ... + 652027300.
It is an arithmetic number, because the mean of its divisors is an integer number (26081088880).
Almost surely, 2103020300997 is an apocalyptic number.
It is an amenable number.
103020300997 is a deficient number, since it is larger than the sum of its proper divisors (1304054523).
103020300997 is an equidigital number, since it uses as much as digits as its factorization.
103020300997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1304054522.
The product of its (nonzero) digits is 10206, while the sum is 34.
The spelling of 103020300997 in words is "one hundred three billion, twenty million, three hundred thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •