Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101100100100100011001101 |
3 | 111021000000120211010210020202 |
4 | 112333112001230210203031 |
5 | 101223041240232410140 |
6 | 555013143201423245 |
7 | 30203646040365245 |
oct | 2677260154444315 |
9 | 437000524123222 |
10 | 101110001060045 |
11 | 2a24256873664a |
12 | b40b96693ab25 |
13 | 445582abc0013 |
14 | 1ad7a70636b25 |
15 | ba518328c915 |
hex | 5bf581b248cd |
101110001060045 has 8 divisors (see below), whose sum is σ = 122465945209824. Its totient is φ = 80132038222864.
The previous prime is 101110001059979. The next prime is 101110001060069. The reversal of 101110001060045 is 540060100011101.
It is a happy number.
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 101110001060045 - 28 = 101110001059789 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101110001059999 and 101110001060026.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94495327559 + ... + 94495328628.
It is an arithmetic number, because the mean of its divisors is an integer number (15308243151228).
Almost surely, 2101110001060045 is an apocalyptic number.
It is an amenable number.
101110001060045 is a deficient number, since it is larger than the sum of its proper divisors (21355944149779).
101110001060045 is a wasteful number, since it uses less digits than its factorization.
101110001060045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188990656299.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 101110001060045 its reverse (540060100011101), we get a palindrome (641170101071146).
The spelling of 101110001060045 in words is "one hundred one trillion, one hundred ten billion, one million, sixty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.951 sec. • engine limits •