Base | Representation |
---|---|
bin | 1010001000001001… |
… | …11111001110110000 |
3 | 112000220220121002110 |
4 | 11010010333032300 |
5 | 42113401004202 |
6 | 2255304245320 |
7 | 251510542665 |
oct | 50404771660 |
9 | 15026817073 |
10 | 5437125552 |
11 | 234012a9a1 |
12 | 1078a70840 |
13 | 68859b571 |
14 | 39816ba6c |
15 | 21c50026c |
hex | 14413f3b0 |
5437125552 has 90 divisors (see below), whose sum is σ = 14586696228. Its totient is φ = 1745111424.
The previous prime is 5437125527. The next prime is 5437125553. The reversal of 5437125552 is 2555217345.
It is a super-2 number, since 2×54371255522 = 59124668536422609408, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5437125552.
It is not an unprimeable number, because it can be changed into a prime (5437125553) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 14814873 + ... + 14815239.
Almost surely, 25437125552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5437125552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7293348114).
5437125552 is an abundant number, since it is smaller than the sum of its proper divisors (9149570676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5437125552 is an equidigital number, since it uses as much as digits as its factorization.
5437125552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803 (or 401 counting only the distinct ones).
The product of its digits is 210000, while the sum is 39.
The square root of 5437125552 is about 73736.8669798222. The cubic root of 5437125552 is about 1758.4220481543.
The spelling of 5437125552 in words is "five billion, four hundred thirty-seven million, one hundred twenty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.887 sec. • engine limits •