Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001001100011011000100111 |
3 | 111020222002001111112221211111 |
4 | 112333030310021203120213 |
5 | 101222411011141200012 |
6 | 555004425512045451 |
7 | 30203145655536124 |
oct | 2677146411433047 |
9 | 436862044487744 |
10 | 101100110100007 |
11 | 2a239352527a07 |
12 | b409a66393887 |
13 | 445491298cc45 |
14 | 1ad73b2b7974b |
15 | ba4ca4c6cba7 |
hex | 5bf334263627 |
101100110100007 has 2 divisors, whose sum is σ = 101100110100008. Its totient is φ = 101100110100006.
The previous prime is 101100110099969. The next prime is 101100110100049. The reversal of 101100110100007 is 700001011001101.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101100110100007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101100110100007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101100110100097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550055050003 + 50550055050004.
It is an arithmetic number, because the mean of its divisors is an integer number (50550055050004).
Almost surely, 2101100110100007 is an apocalyptic number.
101100110100007 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100110100007 is an equidigital number, since it uses as much as digits as its factorization.
101100110100007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 13.
Adding to 101100110100007 its reverse (700001011001101), we get a palindrome (801101121101108).
The spelling of 101100110100007 in words is "one hundred one trillion, one hundred billion, one hundred ten million, one hundred thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •