Base | Representation |
---|---|
bin | 110000010000010000… |
… | …0100011101001000101 |
3 | 100220110210000010222121 |
4 | 1200200200203221011 |
5 | 3144210400324423 |
6 | 115334323125541 |
7 | 10325625512353 |
oct | 1404040435105 |
9 | 326423003877 |
10 | 103624620613 |
11 | 3aa46440228 |
12 | 180bb8138b1 |
13 | 9a05730177 |
14 | 50305bc7d3 |
15 | 2a6756145d |
hex | 1820823a45 |
103624620613 has 8 divisors (see below), whose sum is σ = 106032946968. Its totient is φ = 101233077504.
The previous prime is 103624620569. The next prime is 103624620689. The reversal of 103624620613 is 316026426301.
It can be written as a sum of positive squares in 4 ways, for example, as 3273785089 + 100350835524 = 57217^2 + 316782^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103624620613 is a prime.
It is a super-3 number, since 3×1036246206133 (a number of 34 digits) contains 333 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 (103624620013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4183320 + ... + 4208017.
It is an arithmetic number, because the mean of its divisors is an integer number (13254118371).
Almost surely, 2103624620613 is an apocalyptic number.
It is an amenable number.
103624620613 is a deficient number, since it is larger than the sum of its proper divisors (2408326355).
103624620613 is an equidigital number, since it uses as much as digits as its factorization.
103624620613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8391623.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 103624620613 in words is "one hundred three billion, six hundred twenty-four million, six hundred twenty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •