Base | Representation |
---|---|
bin | 10101010000101101… |
… | …01000111000111101 |
3 | 1002110111021201010211 |
4 | 22220112220320331 |
5 | 141334044112113 |
6 | 5124351032421 |
7 | 552601103125 |
oct | 125026507075 |
9 | 32414251124 |
10 | 11414441533 |
11 | 4928177960 |
12 | 226680b711 |
13 | 10cba54321 |
14 | 7a3d53c85 |
15 | 46c156b3d |
hex | 2a85a8e3d |
11414441533 has 16 divisors (see below), whose sum is σ = 12946248000. Its totient is φ = 9972547200.
The previous prime is 11414441531. The next prime is 11414441579. The reversal of 11414441533 is 33514441411.
11414441533 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11414441533 - 21 = 11414441531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11414441495 and 11414441504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11414441531) 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 15 ways as a sum of consecutive naturals, for example, 158658 + ... + 219091.
It is an arithmetic number, because the mean of its divisors is an integer number (809140500).
Almost surely, 211414441533 is an apocalyptic number.
It is an amenable number.
11414441533 is a deficient number, since it is larger than the sum of its proper divisors (1531806467).
11414441533 is a wasteful number, since it uses less digits than its factorization.
11414441533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377868.
The product of its digits is 11520, while the sum is 31.
Adding to 11414441533 its reverse (33514441411), we get a palindrome (44928882944).
The spelling of 11414441533 in words is "eleven billion, four hundred fourteen million, four hundred forty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •