Base | Representation |
---|---|
bin | 1001111010111010… |
… | …11111110110110100 |
3 | 111202012000102120020 |
4 | 10331131133312310 |
5 | 41401441011012 |
6 | 2240301005140 |
7 | 245662121610 |
oct | 47535376664 |
9 | 14665012506 |
10 | 5326110132 |
11 | 22934a5412 |
12 | 10478537b0 |
13 | 66b59bc75 |
14 | 387510340 |
15 | 2128c1a8c |
hex | 13d75fdb4 |
5326110132 has 96 divisors (see below), whose sum is σ = 15322390272. Its totient is φ = 1405188096.
The previous prime is 5326110109. The next prime is 5326110133. The reversal of 5326110132 is 2310116235.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5326110133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40498 + ... + 110870.
It is an arithmetic number, because the mean of its divisors is an integer number (159608232).
Almost surely, 25326110132 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 5326110132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7661195136).
5326110132 is an abundant number, since it is smaller than the sum of its proper divisors (9996280140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5326110132 is a wasteful number, since it uses less digits than its factorization.
5326110132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70457 (or 70455 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 5326110132 is about 72980.2036993595. The cubic root of 5326110132 is about 1746.3718171733.
Adding to 5326110132 its reverse (2310116235), we get a palindrome (7636226367).
The spelling of 5326110132 in words is "five billion, three hundred twenty-six million, one hundred ten thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •