Base | Representation |
---|---|
bin | 1011010000110010… |
… | …1001010110110001 |
3 | 21210200201011221221 |
4 | 2310030221112301 |
5 | 22142420322001 |
6 | 1215553545041 |
7 | 134626615663 |
oct | 26414512661 |
9 | 7720634857 |
10 | 3023214001 |
11 | 1311586475 |
12 | 704575181 |
13 | 392451832 |
14 | 20972a533 |
15 | 12a62c1a1 |
hex | b43295b1 |
3023214001 has 4 divisors (see below), whose sum is σ = 3154658112. Its totient is φ = 2891769892.
The previous prime is 3023213983. The next prime is 3023214049. The reversal of 3023214001 is 1004123203.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1004123203 = 107 ⋅9384329.
It is a cyclic number.
It is not a de Polignac number, because 3023214001 - 211 = 3023211953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3023214071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65722021 + ... + 65722066.
It is an arithmetic number, because the mean of its divisors is an integer number (788664528).
Almost surely, 23023214001 is an apocalyptic number.
It is an amenable number.
3023214001 is a deficient number, since it is larger than the sum of its proper divisors (131444111).
3023214001 is a wasteful number, since it uses less digits than its factorization.
3023214001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131444110.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 3023214001 is about 54983.7612482085. The cubic root of 3023214001 is about 1445.9600586664.
Adding to 3023214001 its reverse (1004123203), we get a palindrome (4027337204).
The spelling of 3023214001 in words is "three billion, twenty-three million, two hundred fourteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •