Base | Representation |
---|---|
bin | 1010001010000011… |
… | …01111100011110110 |
3 | 112002000212202021110 |
4 | 11011001233203312 |
5 | 42131440132100 |
6 | 2301033455450 |
7 | 252063115140 |
oct | 50501574366 |
9 | 15060782243 |
10 | 5453052150 |
11 | 2349118877 |
12 | 1082271586 |
13 | 68b9868a0 |
14 | 39a315c90 |
15 | 21dae9250 |
hex | 14506f8f6 |
5453052150 has 96 divisors (see below), whose sum is σ = 16644434688. Its totient is φ = 1150531200.
The previous prime is 5453052113. The next prime is 5453052173. The reversal of 5453052150 is 512503545.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 186096 + ... + 213395.
It is an arithmetic number, because the mean of its divisors is an integer number (173379528).
Almost surely, 25453052150 is an apocalyptic number.
5453052150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5453052150 is an abundant number, since it is smaller than the sum of its proper divisors (11191382538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5453052150 is a wasteful number, since it uses less digits than its factorization.
5453052150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399526 (or 399521 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 30.
The square root of 5453052150 is about 73844.7841759999. The cubic root of 5453052150 is about 1760.1373160338.
Adding to 5453052150 its reverse (512503545), we get a palindrome (5965555695).
The spelling of 5453052150 in words is "five billion, four hundred fifty-three million, fifty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •