Base | Representation |
---|---|
bin | 1100000111010110… |
… | …1010011100010001 |
3 | 22101122100021121000 |
4 | 3001311222130101 |
5 | 23130012221121 |
6 | 1254411052213 |
7 | 143406066054 |
oct | 30165523421 |
9 | 8348307530 |
10 | 3252070161 |
11 | 141978849a |
12 | 769141069 |
13 | 3ca9a0292 |
14 | 22bca0a9b |
15 | 140786526 |
hex | c1d6a711 |
3252070161 has 8 divisors (see below), whose sum is σ = 4817881760. Its totient is φ = 2168046756.
The previous prime is 3252070123. The next prime is 3252070169. The reversal of 3252070161 is 1610702523.
It is a happy number.
It is not a de Polignac number, because 3252070161 - 29 = 3252069649 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 120447043 = 3252070161 / (3 + 2 + 5 + 2 + 0 + 7 + 0 + 1 + 6 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3252070169) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60223495 + ... + 60223548.
It is an arithmetic number, because the mean of its divisors is an integer number (602235220).
Almost surely, 23252070161 is an apocalyptic number.
It is an amenable number.
3252070161 is a deficient number, since it is larger than the sum of its proper divisors (1565811599).
3252070161 is a wasteful number, since it uses less digits than its factorization.
3252070161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120447052 (or 120447046 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 3252070161 is about 57026.9248776400. The cubic root of 3252070161 is about 1481.5624722618.
Adding to 3252070161 its reverse (1610702523), we get a palindrome (4862772684).
The spelling of 3252070161 in words is "three billion, two hundred fifty-two million, seventy thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •