Base | Representation |
---|---|
bin | 1001100101000110… |
… | …10001100110001100 |
3 | 111021102121021212010 |
4 | 10302203101212030 |
5 | 41013111401322 |
6 | 2210201541220 |
7 | 241310263242 |
oct | 46243214614 |
9 | 14242537763 |
10 | 5143075212 |
11 | 21aa14a590 |
12 | bb64a4810 |
13 | 63c6a4892 |
14 | 36b0a6792 |
15 | 2017b920c |
hex | 1328d198c |
5143075212 has 144 divisors (see below), whose sum is σ = 14358758400. Its totient is φ = 1419187200.
The previous prime is 5143075193. The next prime is 5143075277. The reversal of 5143075212 is 2125703415.
It is a self number, because there is not a number n which added to its sum of digits gives 5143075212.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1180414 + ... + 1184762.
It is an arithmetic number, because the mean of its divisors is an integer number (99713600).
Almost surely, 25143075212 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 5143075212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7179379200).
5143075212 is an abundant number, since it is smaller than the sum of its proper divisors (9215683188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5143075212 is a wasteful number, since it uses less digits than its factorization.
5143075212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4432 (or 4413 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 5143075212 is about 71715.2369584038. The cubic root of 5143075212 is about 1726.1331446624.
Adding to 5143075212 its reverse (2125703415), we get a palindrome (7268778627).
The spelling of 5143075212 in words is "five billion, one hundred forty-three million, seventy-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •