Base | Representation |
---|---|
bin | 1011001011110010… |
… | …0010001010011111 |
3 | 21202020012020000221 |
4 | 2302330202022133 |
5 | 22122031304043 |
6 | 1213523502211 |
7 | 134253250435 |
oct | 26274421237 |
9 | 7666166027 |
10 | 3002213023 |
11 | 1300742097 |
12 | 6b9527967 |
13 | 38acaa914 |
14 | 206a20d55 |
15 | 12887e8ed |
hex | b2f2229f |
3002213023 has 8 divisors (see below), whose sum is σ = 3240770400. Its totient is φ = 2772657888.
The previous prime is 3002213021. The next prime is 3002213077. The reversal of 3002213023 is 3203122003.
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 3002213023 - 21 = 3002213021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3002212988 and 3002213006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002213021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2249868 + ... + 2251201.
It is an arithmetic number, because the mean of its divisors is an integer number (405096300).
Almost surely, 23002213023 is an apocalyptic number.
3002213023 is a deficient number, since it is larger than the sum of its proper divisors (238557377).
3002213023 is a wasteful number, since it uses less digits than its factorization.
3002213023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4501121.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 3002213023 is about 54792.4540698808. The cubic root of 3002213023 is about 1442.6041199711.
Adding to 3002213023 its reverse (3203122003), we get a palindrome (6205335026).
The spelling of 3002213023 in words is "three billion, two million, two hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •