Base | Representation |
---|---|
bin | 1011001011011111… |
… | …1111101011110111 |
3 | 21202010221202221021 |
4 | 2302313333223313 |
5 | 22121230220343 |
6 | 1213442202011 |
7 | 134240163562 |
oct | 26267775367 |
9 | 7663852837 |
10 | 3001023223 |
11 | 12aaaaa190 |
12 | 6b9053307 |
13 | 38a9821b3 |
14 | 2067d14d9 |
15 | 1286e70ed |
hex | b2dffaf7 |
3001023223 has 8 divisors (see below), whose sum is σ = 3297741840. Its totient is φ = 2708287680.
The previous prime is 3001023203. The next prime is 3001023227. The reversal of 3001023223 is 3223201003.
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 3001023223 - 29 = 3001022711 is a prime.
It is a super-2 number, since 2×30010232232 = 18012280769970615458, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3001023197 and 3001023206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3001023227) 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, 994188 + ... + 997201.
It is an arithmetic number, because the mean of its divisors is an integer number (412217730).
Almost surely, 23001023223 is an apocalyptic number.
3001023223 is a deficient number, since it is larger than the sum of its proper divisors (296718617).
3001023223 is a wasteful number, since it uses less digits than its factorization.
3001023223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1991537.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 3001023223 is about 54781.5956594913. The cubic root of 3001023223 is about 1442.4135231057.
Adding to 3001023223 its reverse (3223201003), we get a palindrome (6224224226).
The spelling of 3001023223 in words is "three billion, one million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •