Base | Representation |
---|---|
bin | 1010010100110010… |
… | …11100100111110000 |
3 | 112022022102022012002 |
4 | 11022121130213300 |
5 | 42323021331422 |
6 | 2314012553132 |
7 | 254236005221 |
oct | 51231344760 |
9 | 15268368162 |
10 | 5543152112 |
11 | 2394a68253 |
12 | 10a84827a8 |
13 | 6a4542184 |
14 | 3a828b248 |
15 | 226995692 |
hex | 14a65c9f0 |
5543152112 has 120 divisors (see below), whose sum is σ = 11786433120. Its totient is φ = 2523248640.
The previous prime is 5543152103. The next prime is 5543152117. The reversal of 5543152112 is 2112513455.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5543152117) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21076493 + ... + 21076755.
It is an arithmetic number, because the mean of its divisors is an integer number (98220276).
Almost surely, 25543152112 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 5543152112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5893216560).
5543152112 is an abundant number, since it is smaller than the sum of its proper divisors (6243281008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5543152112 is a wasteful number, since it uses less digits than its factorization.
5543152112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 439 (or 414 counting only the distinct ones).
The product of its digits is 6000, while the sum is 29.
The square root of 5543152112 is about 74452.3479280540. The cubic root of 5543152112 is about 1769.7785706168.
Adding to 5543152112 its reverse (2112513455), we get a palindrome (7655665567).
The spelling of 5543152112 in words is "five billion, five hundred forty-three million, one hundred fifty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •