Base | Representation |
---|---|
bin | 1111001001010001… |
… | …00100100010010000 |
3 | 202222122112211200021 |
4 | 13210220210202100 |
5 | 113122441323302 |
6 | 3422451233224 |
7 | 405326504311 |
oct | 74450444220 |
9 | 22878484607 |
10 | 8130807952 |
11 | 34a26a13a3 |
12 | 16aaba8814 |
13 | 9c7682587 |
14 | 571bd8608 |
15 | 328c38437 |
hex | 1e4a24890 |
8130807952 has 20 divisors (see below), whose sum is σ = 16296663420. Its totient is φ = 3925217408.
The previous prime is 8130807917. The next prime is 8130807953. The reversal of 8130807952 is 2597080318.
It can be written as a sum of positive squares in 2 ways, for example, as 3176900496 + 4953907456 = 56364^2 + 70384^2 .
It is a super-2 number, since 2×81308079522 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 8130807899 and 8130807908.
It is not an unprimeable number, because it can be changed into a prime (8130807953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8761183 + ... + 8762110.
It is an arithmetic number, because the mean of its divisors is an integer number (814833171).
Almost surely, 28130807952 is an apocalyptic number.
It is an amenable number.
8130807952 is an abundant number, since it is smaller than the sum of its proper divisors (8165855468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8130807952 is a wasteful number, since it uses less digits than its factorization.
8130807952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17523330 (or 17523324 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 43.
The square root of 8130807952 is about 90170.9928524689. The cubic root of 8130807952 is about 2010.8417843239.
The spelling of 8130807952 in words is "eight billion, one hundred thirty million, eight hundred seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •