Base | Representation |
---|---|
bin | 1010001000000101… |
… | …10011110100101000 |
3 | 112000212211120210201 |
4 | 11010002303310220 |
5 | 42113224221121 |
6 | 2255244121544 |
7 | 251502644140 |
oct | 50402636450 |
9 | 15025746721 |
10 | 5436554536 |
11 | 233a87a986 |
12 | 10788362b4 |
13 | 68842b69a |
14 | 39805d920 |
15 | 21c43ae91 |
hex | 1440b3d28 |
5436554536 has 16 divisors (see below), whose sum is σ = 11649759840. Its totient is φ = 2329951920.
The previous prime is 5436554533. The next prime is 5436554567. The reversal of 5436554536 is 6354556345.
It is a super-2 number, since 2×54365545362 = 59112250445804350592, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5436554533) by changing a digit.
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, 48540610 + ... + 48540721.
It is an arithmetic number, because the mean of its divisors is an integer number (728109990).
Almost surely, 25436554536 is an apocalyptic number.
5436554536 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
5436554536 is an abundant number, since it is smaller than the sum of its proper divisors (6213205304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5436554536 is a wasteful number, since it uses less digits than its factorization.
5436554536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97081344 (or 97081340 counting only the distinct ones).
The product of its digits is 3240000, while the sum is 46.
The square root of 5436554536 is about 73732.9948937380. The cubic root of 5436554536 is about 1758.3604885264.
The spelling of 5436554536 in words is "five billion, four hundred thirty-six million, five hundred fifty-four thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •