Base | Representation |
---|---|
bin | 10100111101011110… |
… | …11010001010000111 |
3 | 1002001020210220002011 |
4 | 22132233122022013 |
5 | 141021302201011 |
6 | 5100350155051 |
7 | 545602206214 |
oct | 123657321207 |
9 | 32036726064 |
10 | 11253162631 |
11 | 4855131707 |
12 | 22207b2a87 |
13 | 10a4506719 |
14 | 78a770b0b |
15 | 45cdea621 |
hex | 29ebda287 |
11253162631 has 16 divisors (see below), whose sum is σ = 11992428000. Its totient is φ = 10559255424.
The previous prime is 11253162629. The next prime is 11253162637. The reversal of 11253162631 is 13626135211.
It is not a de Polignac number, because 11253162631 - 21 = 11253162629 is a prime.
It is a super-2 number, since 2×112531626312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11253162593 and 11253162602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11253162637) 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 15 ways as a sum of consecutive naturals, for example, 1711356 + ... + 1717918.
It is an arithmetic number, because the mean of its divisors is an integer number (749526750).
Almost surely, 211253162631 is an apocalyptic number.
11253162631 is a deficient number, since it is larger than the sum of its proper divisors (739265369).
11253162631 is an frugal number, since it uses more digits than its factorization.
11253162631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6963 (or 6929 counting only the distinct ones).
The product of its digits is 6480, while the sum is 31.
Adding to 11253162631 its reverse (13626135211), we get a palindrome (24879297842).
The spelling of 11253162631 in words is "eleven billion, two hundred fifty-three million, one hundred sixty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •