Base | Representation |
---|---|
bin | 1100000000010000… |
… | …0110010101110111 |
3 | 22022120022210122022 |
4 | 3000010012111313 |
5 | 23044402100043 |
6 | 1251425023355 |
7 | 142565045465 |
oct | 30004062567 |
9 | 8276283568 |
10 | 3222300023 |
11 | 14039a4778 |
12 | 75b184b5b |
13 | 3c4778b07 |
14 | 227d51835 |
15 | 13cd55868 |
hex | c0106577 |
3222300023 has 8 divisors (see below), whose sum is σ = 3373882848. Its totient is φ = 3071674144.
The previous prime is 3222300013. The next prime is 3222300043. The reversal of 3222300023 is 3200032223.
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 3222300023 - 26 = 3222299959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3222299974 and 3222300010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3222300013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 232340 + ... + 245817.
It is an arithmetic number, because the mean of its divisors is an integer number (421735356).
Almost surely, 23222300023 is an apocalyptic number.
3222300023 is a deficient number, since it is larger than the sum of its proper divisors (151582825).
3222300023 is a wasteful number, since it uses less digits than its factorization.
3222300023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478473.
The product of its (nonzero) digits is 432, while the sum is 17.
The square root of 3222300023 is about 56765.3065084652. The cubic root of 3222300023 is about 1477.0277613523.
Adding to 3222300023 its reverse (3200032223), we get a palindrome (6422332246).
The spelling of 3222300023 in words is "three billion, two hundred twenty-two million, three hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •