Base | Representation |
---|---|
bin | 110001011001011011… |
… | …1000101100000011111 |
3 | 101010210220020100100001 |
4 | 1202302313011200133 |
5 | 3214222440000111 |
6 | 120422114315131 |
7 | 10443522060055 |
oct | 1426267054037 |
9 | 333726210301 |
10 | 106080000031 |
11 | 40a96438115 |
12 | 18685b88aa7 |
13 | a0073388b5 |
14 | 51c47361d5 |
15 | 2b5cdc61c1 |
hex | 18b2dc581f |
106080000031 has 2 divisors, whose sum is σ = 106080000032. Its totient is φ = 106080000030.
The previous prime is 106080000011. The next prime is 106080000079. The reversal of 106080000031 is 130000080601.
It is a weak prime.
It is an emirp because it is prime and its reverse (130000080601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106080000031 - 27 = 106079999903 is a prime.
It is a super-2 number, since 2×1060800000312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106079999963 and 106080000008.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106080000011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53040000015 + 53040000016.
It is an arithmetic number, because the mean of its divisors is an integer number (53040000016).
Almost surely, 2106080000031 is an apocalyptic number.
106080000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
106080000031 is an equidigital number, since it uses as much as digits as its factorization.
106080000031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 106080000031 its reverse (130000080601), we get a palindrome (236080080632).
The spelling of 106080000031 in words is "one hundred six billion, eighty million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •