Base | Representation |
---|---|
bin | 1110101101111000… |
… | …0101100010000100 |
3 | 101012022121212010102 |
4 | 3223132011202010 |
5 | 31042314021430 |
6 | 1452001343232 |
7 | 166616655110 |
oct | 35336054204 |
9 | 11168555112 |
10 | 3950532740 |
11 | 1747a777a0 |
12 | 923037b18 |
13 | 4ac5c194b |
14 | 296958740 |
15 | 181c53345 |
hex | eb785884 |
3950532740 has 192 divisors, whose sum is σ = 10816339968. Its totient is φ = 1176076800.
The previous prime is 3950532721. The next prime is 3950532757. The reversal of 3950532740 is 472350593.
It is a junction number, because it is equal to n+sod(n) for n = 3950532694 and 3950532703.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3961922 + ... + 3962918.
It is an arithmetic number, because the mean of its divisors is an integer number (56335104).
Almost surely, 23950532740 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 3950532740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5408169984).
3950532740 is an abundant number, since it is smaller than the sum of its proper divisors (6865807228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3950532740 is a wasteful number, since it uses less digits than its factorization.
3950532740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1138 (or 1136 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 38.
The square root of 3950532740 is about 62853.2635588638. The cubic root of 3950532740 is about 1580.8301918139.
It can be divided in two parts, 395053 and 2740, that added together give a palindrome (397793).
The spelling of 3950532740 in words is "three billion, nine hundred fifty million, five hundred thirty-two thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •