Base | Representation |
---|---|
bin | 10111011100011100101100… |
… | …101101100101100111001001 |
3 | 111112002020000021111010002001 |
4 | 113130130230231211213021 |
5 | 102003323320141214423 |
6 | 1003144032135311001 |
7 | 30501311444152621 |
oct | 2734345455454711 |
9 | 445066007433061 |
10 | 103110030023113 |
11 | 2a943799969853 |
12 | b6934b851b461 |
13 | 456c3074553a9 |
14 | 1b667a2ca5881 |
15 | bdc1dda8bcad |
hex | 5dc72cb659c9 |
103110030023113 has 8 divisors (see below), whose sum is σ = 108969291537120. Its totient is φ = 97294010292000.
The previous prime is 103110030023071. The next prime is 103110030023123. The reversal of 103110030023113 is 311320030011301.
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 103110030023113 - 217 = 103110029892041 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103110030023123) 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, 10810440820 + ... + 10810450357.
It is an arithmetic number, because the mean of its divisors is an integer number (13621161442140).
Almost surely, 2103110030023113 is an apocalyptic number.
It is an amenable number.
103110030023113 is a deficient number, since it is larger than the sum of its proper divisors (5859261514007).
103110030023113 is a wasteful number, since it uses less digits than its factorization.
103110030023113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21620891447.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 103110030023113 its reverse (311320030011301), we get a palindrome (414430060034414).
The spelling of 103110030023113 in words is "one hundred three trillion, one hundred ten billion, thirty million, twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •