Base | Representation |
---|---|
bin | 10111011100011111011110… |
… | …100100100100010100110001 |
3 | 111112002111201020100222221101 |
4 | 113130133132210210110301 |
5 | 102003400423041043433 |
6 | 1003145244212324401 |
7 | 30501445416443461 |
oct | 2734373644442461 |
9 | 445074636328841 |
10 | 103113014002993 |
11 | 2a944a90288025 |
12 | b693bab913701 |
13 | 456c69171ab67 |
14 | 1b669a72dbba1 |
15 | bdc315a1907d |
hex | 5dc7de924531 |
103113014002993 has 8 divisors (see below), whose sum is σ = 106934641759080. Its totient is φ = 99309120019200.
The previous prime is 103113014002967. The next prime is 103113014003081. The reversal of 103113014002993 is 399200410311301.
It can be written as a sum of positive squares in 4 ways, for example, as 34025382264384 + 69087631738609 = 5833128^2 + 8311897^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103113014002993 - 25 = 103113014002961 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103113014008993) 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, 4433431230 + ... + 4433454487.
It is an arithmetic number, because the mean of its divisors is an integer number (13366830219885).
Almost surely, 2103113014002993 is an apocalyptic number.
It is an amenable number.
103113014002993 is a deficient number, since it is larger than the sum of its proper divisors (3821627756087).
103113014002993 is an equidigital number, since it uses as much as digits as its factorization.
103113014002993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8866886147.
The product of its (nonzero) digits is 17496, while the sum is 37.
The spelling of 103113014002993 in words is "one hundred three trillion, one hundred thirteen billion, fourteen million, two thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •