Base | Representation |
---|---|
bin | 1001100101000000… |
… | …00010011000000000 |
3 | 111021101000011112211 |
4 | 10302200002120000 |
5 | 41012402221212 |
6 | 2210131431504 |
7 | 241300126540 |
oct | 46240023000 |
9 | 14241004484 |
10 | 5142226432 |
11 | 21a971a912 |
12 | bb6155594 |
13 | 63c468445 |
14 | 36ad25320 |
15 | 20169c9a7 |
hex | 132802600 |
5142226432 has 120 divisors (see below), whose sum is σ = 12141307728. Its totient is φ = 2131292160.
The previous prime is 5142226421. The next prime is 5142226457. The reversal of 5142226432 is 2346222415.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 5142226394 and 5142226403.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3443478 + ... + 3444970.
Almost surely, 25142226432 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 5142226432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6070653864).
5142226432 is an abundant number, since it is smaller than the sum of its proper divisors (6999081296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5142226432 is an equidigital number, since it uses as much as digits as its factorization.
5142226432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1580 (or 1533 counting only the distinct ones).
The product of its digits is 23040, while the sum is 31.
The square root of 5142226432 is about 71709.3190038784. The cubic root of 5142226432 is about 1726.0381828069.
Adding to 5142226432 its reverse (2346222415), we get a palindrome (7488448847).
The spelling of 5142226432 in words is "five billion, one hundred forty-two million, two hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •