Base | Representation |
---|---|
bin | 10101010000011011… |
… | …10100111000011011 |
3 | 1002110022221100011200 |
4 | 22220031310320123 |
5 | 141333001200410 |
6 | 5124225325243 |
7 | 552542341662 |
oct | 125015647033 |
9 | 32408840150 |
10 | 11412131355 |
11 | 492693a219 |
12 | 2265a96823 |
13 | 10cb425961 |
14 | 7a3911dd9 |
15 | 46bd4c3c0 |
hex | 2a8374e1b |
11412131355 has 48 divisors (see below), whose sum is σ = 20036484000. Its totient is φ = 6008099328.
The previous prime is 11412131351. The next prime is 11412131407. The reversal of 11412131355 is 55313121411.
11412131355 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 11412131355 - 22 = 11412131351 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11412131351) 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 47 ways as a sum of consecutive naturals, for example, 2837536 + ... + 2841554.
It is an arithmetic number, because the mean of its divisors is an integer number (417426750).
Almost surely, 211412131355 is an apocalyptic number.
11412131355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11412131355 is a deficient number, since it is larger than the sum of its proper divisors (8624352645).
11412131355 is a wasteful number, since it uses less digits than its factorization.
11412131355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4828 (or 4825 counting only the distinct ones).
The product of its digits is 1800, while the sum is 27.
Adding to 11412131355 its reverse (55313121411), we get a palindrome (66725252766).
The spelling of 11412131355 in words is "eleven billion, four hundred twelve million, one hundred thirty-one thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •