Base | Representation |
---|---|
bin | 1011001110001010… |
… | …1001010111100001 |
3 | 21202220222211002011 |
4 | 2303202221113201 |
5 | 22132111012001 |
6 | 1214521552521 |
7 | 134434211602 |
oct | 26342512741 |
9 | 7686884064 |
10 | 3012204001 |
11 | 13063464a4 |
12 | 700945741 |
13 | 390098341 |
14 | 2080a1da9 |
15 | 1296a4d51 |
hex | b38a95e1 |
3012204001 has 8 divisors (see below), whose sum is σ = 3114687744. Its totient is φ = 2910052560.
The previous prime is 3012203959. The next prime is 3012204011. The reversal of 3012204001 is 1004022103.
3012204001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3012204001 - 221 = 3010106849 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3012204011) 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, 64570 + ... + 100963.
It is an arithmetic number, because the mean of its divisors is an integer number (389335968).
Almost surely, 23012204001 is an apocalyptic number.
3012204001 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
3012204001 is a deficient number, since it is larger than the sum of its proper divisors (102483743).
3012204001 is a wasteful number, since it uses less digits than its factorization.
3012204001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166151.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 3012204001 is about 54883.5494570094. The cubic root of 3012204001 is about 1444.2026149455.
Adding to 3012204001 its reverse (1004022103), we get a palindrome (4016226104).
The spelling of 3012204001 in words is "three billion, twelve million, two hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •