Base | Representation |
---|---|
bin | 1010000111101011… |
… | …00001011100101000 |
3 | 112000122021121211200 |
4 | 11003311201130220 |
5 | 42111331241100 |
6 | 2255041324200 |
7 | 251431226211 |
oct | 50365413450 |
9 | 15018247750 |
10 | 5433071400 |
11 | 2338910a59 |
12 | 1077636660 |
13 | 6877ac163 |
14 | 3977d4408 |
15 | 21be9de00 |
hex | 143d61728 |
5433071400 has 144 divisors (see below), whose sum is σ = 18342754560. Its totient is φ = 1441142400.
The previous prime is 5433071387. The next prime is 5433071419. The reversal of 5433071400 is 41703345.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 335899 + ... + 351701.
It is an arithmetic number, because the mean of its divisors is an integer number (127380240).
Almost surely, 25433071400 is an apocalyptic number.
5433071400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5433071400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9171377280).
5433071400 is an abundant number, since it is smaller than the sum of its proper divisors (12909683160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5433071400 is a wasteful number, since it uses less digits than its factorization.
5433071400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16016 (or 16004 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 5433071400 is about 73709.3711816890. The cubic root of 5433071400 is about 1757.9848880653.
Adding to 5433071400 its reverse (41703345), we get a palindrome (5474774745).
The spelling of 5433071400 in words is "five billion, four hundred thirty-three million, seventy-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •