Base | Representation |
---|---|
bin | 10100101111010011… |
… | …10000111010000000 |
3 | 1001201222001010020100 |
4 | 22113221300322000 |
5 | 140300331224212 |
6 | 5040501242400 |
7 | 542626333125 |
oct | 122751607200 |
9 | 31658033210 |
10 | 11134242432 |
11 | 47a3a98155 |
12 | 21a8a03400 |
13 | 108599a141 |
14 | 778a5674c |
15 | 452759bdc |
hex | 297a70e80 |
11134242432 has 48 divisors (see below), whose sum is σ = 32039945730. Its totient is φ = 3711413760.
The previous prime is 11134242401. The next prime is 11134242451. The reversal of 11134242432 is 23424243111.
It can be written as a sum of positive squares in only one way, i.e., 7092334656 + 4041907776 = 84216^2 + 63576^2 .
It is a tau number, because it is divible by the number of its divisors (48).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 11134242396 and 11134242405.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4831419 + ... + 4833722.
Almost surely, 211134242432 is an apocalyptic number.
11134242432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11134242432 is an abundant number, since it is smaller than the sum of its proper divisors (20905703298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11134242432 is an equidigital number, since it uses as much as digits as its factorization.
11134242432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9665161 (or 9665146 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
Adding to 11134242432 its reverse (23424243111), we get a palindrome (34558485543).
The spelling of 11134242432 in words is "eleven billion, one hundred thirty-four million, two hundred forty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •