Base | Representation |
---|---|
bin | 10111011011100111101011… |
… | …101010000010101111111111 |
3 | 111111212210002000010111212121 |
4 | 113123213223222002233333 |
5 | 102001410224110444444 |
6 | 1003101535321143411 |
7 | 30464224662016636 |
oct | 2733475352025777 |
9 | 444783060114777 |
10 | 103053103999999 |
11 | 2a92163768a05a |
12 | b68447002ab67 |
13 | 4566b3481144a |
14 | 1b63b2279451d |
15 | bda9ab142084 |
hex | 5db9eba82bff |
103053103999999 has 8 divisors (see below), whose sum is σ = 107632192911120. Its totient is φ = 98568429293376.
The previous prime is 103053103999973. The next prime is 103053104000003. The reversal of 103053103999999 is 999999301350301.
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 103053103999999 - 27 = 103053103999871 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103053103999099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23603548894 + ... + 23603553259.
It is an arithmetic number, because the mean of its divisors is an integer number (13454024113890).
Almost surely, 2103053103999999 is an apocalyptic number.
103053103999999 is a deficient number, since it is larger than the sum of its proper divisors (4579088911121).
103053103999999 is an equidigital number, since it uses as much as digits as its factorization.
103053103999999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47207102249.
The product of its (nonzero) digits is 71744535, while the sum is 70.
The spelling of 103053103999999 in words is "one hundred three trillion, fifty-three billion, one hundred three million, nine hundred ninety-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •