Base | Representation |
---|---|
bin | 1110110010001010… |
… | …1100111101101101 |
3 | 101020120110201001220 |
4 | 3230202230331231 |
5 | 31111420120140 |
6 | 1453443053553 |
7 | 200225602200 |
oct | 35442547555 |
9 | 11216421056 |
10 | 3968520045 |
11 | 1757142936 |
12 | 9290712b9 |
13 | 4b324bc19 |
14 | 2990bb937 |
15 | 183607bd0 |
hex | ec8acf6d |
3968520045 has 48 divisors (see below), whose sum is σ = 7394882688. Its totient is φ = 1812074880.
The previous prime is 3968520043. The next prime is 3968520053. The reversal of 3968520045 is 5400258693.
It is not a de Polignac number, because 3968520045 - 21 = 3968520043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3968519979 and 3968520006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3968520043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 755167 + ... + 760403.
It is an arithmetic number, because the mean of its divisors is an integer number (154060056).
Almost surely, 23968520045 is an apocalyptic number.
3968520045 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3968520045 is a deficient number, since it is larger than the sum of its proper divisors (3426362643).
3968520045 is a wasteful number, since it uses less digits than its factorization.
3968520045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6290 (or 6283 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 42.
The square root of 3968520045 is about 62996.1907181696. The cubic root of 3968520045 is about 1583.2258035438.
The spelling of 3968520045 in words is "three billion, nine hundred sixty-eight million, five hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •