Base | Representation |
---|---|
bin | 1011101111100001… |
… | …0110100110000001 |
3 | 22010200020212202221 |
4 | 2323320112212001 |
5 | 22423420041001 |
6 | 1240440411041 |
7 | 141053336623 |
oct | 27370264601 |
9 | 8120225687 |
10 | 3152112001 |
11 | 1378315445 |
12 | 73b776a81 |
13 | 3b307283c |
14 | 21c8c0c13 |
15 | 136ade1a1 |
hex | bbe16981 |
3152112001 has 8 divisors (see below), whose sum is σ = 3339415944. Its totient is φ = 2965017600.
The previous prime is 3152111969. The next prime is 3152112013. The reversal of 3152112001 is 1002112513.
3152112001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 270569601 + 2881542400 = 16449^2 + 53680^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3152112001 - 25 = 3152111969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3152112101) 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, 20860 + ... + 82093.
It is an arithmetic number, because the mean of its divisors is an integer number (417426993).
Almost surely, 23152112001 is an apocalyptic number.
It is an amenable number.
3152112001 is a deficient number, since it is larger than the sum of its proper divisors (187303943).
3152112001 is a wasteful number, since it uses less digits than its factorization.
3152112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104771.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 3152112001 is about 56143.6728492178. The cubic root of 3152112001 is about 1466.2247522330.
Adding to 3152112001 its reverse (1002112513), we get a palindrome (4154224514).
The spelling of 3152112001 in words is "three billion, one hundred fifty-two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •