Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1010110011011000001101 |
3 | 1022202112212101002012002121 |
4 | 2102332112322303120031 |
5 | 2310434300012010333 |
6 | 33251513114252541 |
7 | 2061462263301625 |
oct | 222762672633015 |
9 | 38675771065077 |
10 | 10100000110093 |
11 | 3244427834903 |
12 | 1171545727151 |
13 | 58356c9a60ba |
14 | 26cbb21bb885 |
15 | 127ace1a032d |
hex | 92f96eb360d |
10100000110093 has 2 divisors, whose sum is σ = 10100000110094. Its totient is φ = 10100000110092.
The previous prime is 10100000110073. The next prime is 10100000110103. The reversal of 10100000110093 is 39001100000101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10058780147364 + 41219962729 = 3171558^2 + 203027^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10100000110093 is a prime.
It is a super-2 number, since 2×101000001100932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10100000110063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050000055046 + 5050000055047.
It is an arithmetic number, because the mean of its divisors is an integer number (5050000055047).
Almost surely, 210100000110093 is an apocalyptic number.
It is an amenable number.
10100000110093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10100000110093 is an equidigital number, since it uses as much as digits as its factorization.
10100000110093 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 16.
Adding to 10100000110093 its reverse (39001100000101), we get a palindrome (49101100110194).
The spelling of 10100000110093 in words is "ten trillion, one hundred billion, one hundred ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •