Base | Representation |
---|---|
bin | 10100000111100101… |
… | …10111111001011001 |
3 | 1000212202011000120202 |
4 | 22003302313321121 |
5 | 134110034223131 |
6 | 4543440431545 |
7 | 531442500524 |
oct | 120362677131 |
9 | 30782130522 |
10 | 10801086041 |
11 | 4642a27899 |
12 | 21153185b5 |
13 | 1031960795 |
14 | 7466d1bbb |
15 | 43339bbcb |
hex | 283cb7e59 |
10801086041 has 4 divisors (see below), whose sum is σ = 10804259712. Its totient is φ = 10797912372.
The previous prime is 10801086019. The next prime is 10801086053. The reversal of 10801086041 is 14068010801.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10801086041 - 222 = 10796891737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10801085995 and 10801086013.
It is not an unprimeable number, because it can be changed into a prime (10801086001) 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 in 3 ways as a sum of consecutive naturals, for example, 1581725 + ... + 1588538.
It is an arithmetic number, because the mean of its divisors is an integer number (2701064928).
Almost surely, 210801086041 is an apocalyptic number.
It is an amenable number.
10801086041 is a deficient number, since it is larger than the sum of its proper divisors (3173671).
10801086041 is an equidigital number, since it uses as much as digits as its factorization.
10801086041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3173670.
The product of its (nonzero) digits is 1536, while the sum is 29.
Adding to 10801086041 its reverse (14068010801), we get a palindrome (24869096842).
The spelling of 10801086041 in words is "ten billion, eight hundred one million, eighty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •