Base | Representation |
---|---|
bin | 10101010101000101… |
… | …11100000010101111 |
3 | 1002120001111020220120 |
4 | 22222202330002233 |
5 | 141423003021033 |
6 | 5132143220023 |
7 | 553525523316 |
oct | 125242740257 |
9 | 32501436816 |
10 | 11451220143 |
11 | 4946a08200 |
12 | 2276ba7613 |
13 | 110656080c |
14 | 7a8ba927d |
15 | 4704be1b3 |
hex | 2aa8bc0af |
11451220143 has 96 divisors (see below), whose sum is σ = 18202060800. Its totient is φ = 6378672960.
The previous prime is 11451220129. The next prime is 11451220159. The reversal of 11451220143 is 34102215411.
11451220143 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 11451220143 - 222 = 11447025839 is a prime.
It is a super-2 number, since 2×114512201432 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11451220843) 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 95 ways as a sum of consecutive naturals, for example, 43540630 + ... + 43540892.
It is an arithmetic number, because the mean of its divisors is an integer number (189604800).
Almost surely, 211451220143 is an apocalyptic number.
11451220143 is a deficient number, since it is larger than the sum of its proper divisors (6750840657).
11451220143 is a wasteful number, since it uses less digits than its factorization.
11451220143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473 (or 462 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 11451220143 its reverse (34102215411), we get a palindrome (45553435554).
The spelling of 11451220143 in words is "eleven billion, four hundred fifty-one million, two hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •