Base | Representation |
---|---|
bin | 1010001010000111… |
… | …00000111001110000 |
3 | 112002001202100002220 |
4 | 11011003200321300 |
5 | 42132100011100 |
6 | 2301051441040 |
7 | 252100060503 |
oct | 50503407160 |
9 | 15061670086 |
10 | 5453516400 |
11 | 2349405652 |
12 | 1082456180 |
13 | 68bab9ca7 |
14 | 39a3d713a |
15 | 21db8baa0 |
hex | 1450e0e70 |
5453516400 has 60 divisors (see below), whose sum is σ = 17469434712. Its totient is φ = 1454270720.
The previous prime is 5453516371. The next prime is 5453516483. The reversal of 5453516400 is 46153545.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×54535164002 = 59481682250137920000, which contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 2271099 + ... + 2273498.
Almost surely, 25453516400 is an apocalyptic number.
5453516400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5453516400 is an abundant number, since it is smaller than the sum of its proper divisors (12015918312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5453516400 is a wasteful number, since it uses less digits than its factorization.
5453516400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4544618 (or 4544607 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
The square root of 5453516400 is about 73847.9275267763. The cubic root of 5453516400 is about 1760.1872648538.
Adding to 5453516400 its reverse (46153545), we get a palindrome (5499669945).
The spelling of 5453516400 in words is "five billion, four hundred fifty-three million, five hundred sixteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •