Base | Representation |
---|---|
bin | 1010000010011011… |
… | …11110101000001100 |
3 | 111220120122020000021 |
4 | 11001031332220030 |
5 | 42014110310412 |
6 | 2250432111524 |
7 | 250356011500 |
oct | 50115765014 |
9 | 14816566007 |
10 | 5389150732 |
11 | 2316042789 |
12 | 10649955a4 |
13 | 67b671bb4 |
14 | 391a40300 |
15 | 2181c5607 |
hex | 14137ea0c |
5389150732 has 72 divisors (see below), whose sum is σ = 11351467008. Its totient is φ = 2229847200.
The previous prime is 5389150727. The next prime is 5389150733. The reversal of 5389150732 is 2370519835.
It is a super-2 number, since 2×53891507322 = 58085891224432271648, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5389150733) 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, 3565857 + ... + 3567367.
It is an arithmetic number, because the mean of its divisors is an integer number (157659264).
Almost surely, 25389150732 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 5389150732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5675733504).
5389150732 is an abundant number, since it is smaller than the sum of its proper divisors (5962316276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5389150732 is a wasteful number, since it uses less digits than its factorization.
5389150732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2147 (or 2138 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 43.
The square root of 5389150732 is about 73410.8352493009. The cubic root of 5389150732 is about 1753.2349125103.
The spelling of 5389150732 in words is "five billion, three hundred eighty-nine million, one hundred fifty thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •