Base | Representation |
---|---|
bin | 11001001110010110… |
… | …00011101111110001 |
3 | 1021221202212120122122 |
4 | 30213023003233301 |
5 | 210213240042431 |
6 | 10115434244025 |
7 | 656405024540 |
oct | 144713035761 |
9 | 37852776578 |
10 | 13542112241 |
11 | 581a1953a9 |
12 | 275b286615 |
13 | 137a7acb88 |
14 | 926764157 |
15 | 543d37a7b |
hex | 3272c3bf1 |
13542112241 has 8 divisors (see below), whose sum is σ = 15481383744. Its totient is φ = 11604011760.
The previous prime is 13542112211. The next prime is 13542112267. The reversal of 13542112241 is 14221124531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13542112241 - 222 = 13537917937 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13542112241.
It is not an unprimeable number, because it can be changed into a prime (13542112211) 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 7 ways as a sum of consecutive naturals, for example, 267830 + ... + 314351.
It is an arithmetic number, because the mean of its divisors is an integer number (1935172968).
Almost surely, 213542112241 is an apocalyptic number.
It is an amenable number.
13542112241 is a deficient number, since it is larger than the sum of its proper divisors (1939271503).
13542112241 is an equidigital number, since it uses as much as digits as its factorization.
13542112241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585511.
The product of its digits is 1920, while the sum is 26.
Adding to 13542112241 its reverse (14221124531), we get a palindrome (27763236772).
The spelling of 13542112241 in words is "thirteen billion, five hundred forty-two million, one hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •