Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …111011111000011010011001 |
3 | 112102110222211022000212020102 |
4 | 121000232122323320122121 |
5 | 103404224030220303211 |
6 | 1025541433115105145 |
7 | 32112211331320154 |
oct | 3100563273703231 |
9 | 472428738025212 |
10 | 110001006806681 |
11 | 3206018a692a31 |
12 | 10406b227421b5 |
13 | 494c086a52863 |
14 | 1d24111940c9b |
15 | cab5a2cdaa3b |
hex | 640b9aef8699 |
110001006806681 has 2 divisors, whose sum is σ = 110001006806682. Its totient is φ = 110001006806680.
The previous prime is 110001006806659. The next prime is 110001006806707. The reversal of 110001006806681 is 186608600100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83902027638025 + 26098979168656 = 9159805^2 + 5108716^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001006806681 - 234 = 109983826937497 is a prime.
It is a super-2 number, since 2×1100010068066812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110001006806981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000503403340 + 55000503403341.
It is an arithmetic number, because the mean of its divisors is an integer number (55000503403341).
Almost surely, 2110001006806681 is an apocalyptic number.
It is an amenable number.
110001006806681 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001006806681 is an equidigital number, since it uses as much as digits as its factorization.
110001006806681 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 38.
Adding to 110001006806681 its reverse (186608600100011), we get a palindrome (296609606906692).
The spelling of 110001006806681 in words is "one hundred ten trillion, one billion, six million, eight hundred six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •