Base | Representation |
---|---|
bin | 101111111110001111… |
… | …0100100100000110001 |
3 | 100211220122112100012012 |
4 | 1133330132210200301 |
5 | 3141441122320423 |
6 | 115154330412305 |
7 | 10304635400261 |
oct | 1377436444061 |
9 | 324818470165 |
10 | 103020120113 |
11 | 3a766199039 |
12 | 17b71291095 |
13 | 993a419c71 |
14 | 4db41c37a1 |
15 | 2a2e455078 |
hex | 17fc7a4831 |
103020120113 has 8 divisors (see below), whose sum is σ = 103686963432. Its totient is φ = 102353412096.
The previous prime is 103020120083. The next prime is 103020120167. The reversal of 103020120113 is 311021020301.
It can be written as a sum of positive squares in 4 ways, for example, as 37735782049 + 65284338064 = 194257^2 + 255508^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 103020120113 - 220 = 103019071537 is a prime.
It is a super-2 number, since 2×1030201201132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103020120713) 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, 1821131 + ... + 1876847.
It is an arithmetic number, because the mean of its divisors is an integer number (12960870429).
Almost surely, 2103020120113 is an apocalyptic number.
It is an amenable number.
103020120113 is a deficient number, since it is larger than the sum of its proper divisors (666843319).
103020120113 is a wasteful number, since it uses less digits than its factorization.
103020120113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67651.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 103020120113 its reverse (311021020301), we get a palindrome (414041140414).
The spelling of 103020120113 in words is "one hundred three billion, twenty million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •