Base | Representation |
---|---|
bin | 10100001000110110… |
… | …11111000000011111 |
3 | 1000220111011220002111 |
4 | 22010123133000133 |
5 | 134120300410444 |
6 | 4544500534451 |
7 | 531632130355 |
oct | 120433370037 |
9 | 30814156074 |
10 | 10811731999 |
11 | 4648a39302 |
12 | 21189b1427 |
13 | 1033c1a373 |
14 | 747ca37d5 |
15 | 4342a1234 |
hex | 2846df01f |
10811731999 has 4 divisors (see below), whose sum is σ = 10835083936. Its totient is φ = 10788380064.
The previous prime is 10811731981. The next prime is 10811732003. The reversal of 10811731999 is 99913711801.
10811731999 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 99913711801 = 6343 ⋅15751807.
It is a cyclic number.
It is not a de Polignac number, because 10811731999 - 213 = 10811723807 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10811735999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11675274 + ... + 11676199.
It is an arithmetic number, because the mean of its divisors is an integer number (2708770984).
Almost surely, 210811731999 is an apocalyptic number.
10811731999 is a deficient number, since it is larger than the sum of its proper divisors (23351937).
10811731999 is an equidigital number, since it uses as much as digits as its factorization.
10811731999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23351936.
The product of its (nonzero) digits is 122472, while the sum is 49.
The spelling of 10811731999 in words is "ten billion, eight hundred eleven million, seven hundred thirty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •