Base | Representation |
---|---|
bin | 11110110110110000… |
… | …110100111011010001 |
3 | 10011111221212101221222 |
4 | 132312300310323101 |
5 | 1020323020232311 |
6 | 23115320454425 |
7 | 2252006025641 |
oct | 366660647321 |
9 | 104457771858 |
10 | 33131024081 |
11 | 13061665841 |
12 | 650761a415 |
13 | 317cc6327c |
14 | 18641da521 |
15 | cdd94eadb |
hex | 7b6c34ed1 |
33131024081 has 2 divisors, whose sum is σ = 33131024082. Its totient is φ = 33131024080.
The previous prime is 33131024027. The next prime is 33131024083. The reversal of 33131024081 is 18042013133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29441069056 + 3689955025 = 171584^2 + 60745^2 .
It is an emirp because it is prime and its reverse (18042013133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 33131024081 - 222 = 33126829777 is a prime.
It is a super-2 number, since 2×331310240812 (a number of 22 digits) contains 22 as substring.
Together with 33131024083, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 33131024081.
It is not a weakly prime, because it can be changed into another prime (33131024083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16565512040 + 16565512041.
It is an arithmetic number, because the mean of its divisors is an integer number (16565512041).
Almost surely, 233131024081 is an apocalyptic number.
It is an amenable number.
33131024081 is a deficient number, since it is larger than the sum of its proper divisors (1).
33131024081 is an equidigital number, since it uses as much as digits as its factorization.
33131024081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 33131024081 in words is "thirty-three billion, one hundred thirty-one million, twenty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •