Base | Representation |
---|---|
bin | 101010111100110… |
… | …0100000001110000 |
3 | 10201102210011110002 |
4 | 1111321210001300 |
5 | 10422413400021 |
6 | 355000525132 |
7 | 50466412433 |
oct | 12571440160 |
9 | 3642704402 |
10 | 1441153136 |
11 | 67a547755 |
12 | 3427807a8 |
13 | 19c75a147 |
14 | d958581a |
15 | 867c350b |
hex | 55e64070 |
1441153136 has 20 divisors (see below), whose sum is σ = 2913636432. Its totient is φ = 689246976.
The previous prime is 1441153111. The next prime is 1441153171. The reversal of 1441153136 is 6313511441.
It is a super-2 number, since 2×14411531362 = 4153844722805268992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1441153099 and 1441153108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1957721 + ... + 1958456.
Almost surely, 21441153136 is an apocalyptic number.
1441153136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1441153136 is an abundant number, since it is smaller than the sum of its proper divisors (1472483296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1441153136 is a wasteful number, since it uses less digits than its factorization.
1441153136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3916208 (or 3916202 counting only the distinct ones).
The product of its digits is 4320, while the sum is 29.
The square root of 1441153136 is about 37962.5227823442. The cubic root of 1441153136 is about 1129.5445827112.
Adding to 1441153136 its reverse (6313511441), we get a palindrome (7754664577).
The spelling of 1441153136 in words is "one billion, four hundred forty-one million, one hundred fifty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •