Base | Representation |
---|---|
bin | 1011111110100001… |
… | …0001010101001001 |
3 | 22022001121011202022 |
4 | 2333220101111021 |
5 | 23041020130001 |
6 | 1251004414225 |
7 | 142446043265 |
oct | 27750212511 |
9 | 8261534668 |
10 | 3215005001 |
11 | 13aa87192a |
12 | 758847375 |
13 | 3c30c3530 |
14 | 226db30a5 |
15 | 13c3b411b |
hex | bfa11549 |
3215005001 has 8 divisors (see below), whose sum is σ = 3480255240. Its totient is φ = 2952317952.
The previous prime is 3215004973. The next prime is 3215005043. The reversal of 3215005001 is 1005005123.
3215005001 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 477204025 + 2737800976 = 21845^2 + 52324^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3215005001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3215005051) 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, 638186 + ... + 643203.
It is an arithmetic number, because the mean of its divisors is an integer number (435031905).
Almost surely, 23215005001 is an apocalyptic number.
It is an amenable number.
3215005001 is a deficient number, since it is larger than the sum of its proper divisors (265250239).
3215005001 is a wasteful number, since it uses less digits than its factorization.
3215005001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1281595.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 3215005001 is about 56701.0141090968. The cubic root of 3215005001 is about 1475.9122960657.
The spelling of 3215005001 in words is "three billion, two hundred fifteen million, five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •