Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …011001100011000110101 |
3 | 10220021010112221000102022 |
4 | 100001132223030120311 |
5 | 121020023100242023 |
6 | 2201501030322525 |
7 | 142360166435624 |
oct | 20013653143065 |
9 | 3807115830368 |
10 | 1101100009013 |
11 | 394a79282054 |
12 | 1594981b9445 |
13 | 7caaa960094 |
14 | 3b4176096bb |
15 | 1d9973397c8 |
hex | 1005eacc635 |
1101100009013 has 2 divisors, whose sum is σ = 1101100009014. Its totient is φ = 1101100009012.
The previous prime is 1101100008973. The next prime is 1101100009043. The reversal of 1101100009013 is 3109000011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1090785981649 + 10314027364 = 1044407^2 + 101558^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101100009013 - 210 = 1101100007989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101100008982 and 1101100009000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101100009043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550550004506 + 550550004507.
It is an arithmetic number, because the mean of its divisors is an integer number (550550004507).
Almost surely, 21101100009013 is an apocalyptic number.
It is an amenable number.
1101100009013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101100009013 is an equidigital number, since it uses as much as digits as its factorization.
1101100009013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 1101100009013 in words is "one trillion, one hundred one billion, one hundred million, nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •