Base | Representation |
---|---|
bin | 110000000011100111… |
… | …1010010000111111101 |
3 | 100212101020020211010020 |
4 | 1200013033102013331 |
5 | 3142323332141023 |
6 | 115224300202353 |
7 | 10312260103431 |
oct | 1400717220775 |
9 | 325336224106 |
10 | 103200662013 |
11 | 3a8490a0919 |
12 | 180018393b9 |
13 | 99689506a7 |
14 | 4dd017c9c1 |
15 | 2a40218de3 |
hex | 18073d21fd |
103200662013 has 8 divisors (see below), whose sum is σ = 137937316800. Its totient is φ = 68632224288.
The previous prime is 103200661979. The next prime is 103200662039. The reversal of 103200662013 is 310266002301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103200662013 - 28 = 103200661757 is a prime.
It is a super-2 number, since 2×1032006620132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103200662053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42052833 + ... + 42055286.
It is an arithmetic number, because the mean of its divisors is an integer number (17242164600).
Almost surely, 2103200662013 is an apocalyptic number.
It is an amenable number.
103200662013 is a deficient number, since it is larger than the sum of its proper divisors (34736654787).
103200662013 is an equidigital number, since it uses as much as digits as its factorization.
103200662013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84108531.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 103200662013 its reverse (310266002301), we get a palindrome (413466664314).
The spelling of 103200662013 in words is "one hundred three billion, two hundred million, six hundred sixty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •