Base | Representation |
---|---|
bin | 1000000100001100… |
… | …11110100111110111 |
3 | 102011210001222011101 |
4 | 10002012132213313 |
5 | 32332014020043 |
6 | 1553403350531 |
7 | 212210156113 |
oct | 40206364767 |
9 | 12153058141 |
10 | 4330220023 |
11 | 1922329438 |
12 | a0a222447 |
13 | 54017068c |
14 | 2d1152743 |
15 | 1a525324d |
hex | 10219e9f7 |
4330220023 has 8 divisors (see below), whose sum is σ = 4558763520. Its totient is φ = 4101740280.
The previous prime is 4330220017. The next prime is 4330220033. The reversal of 4330220023 is 3200220334.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4330220023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4330220033) 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, 195588 + ... + 216598.
It is an arithmetic number, because the mean of its divisors is an integer number (569845440).
Almost surely, 24330220023 is an apocalyptic number.
4330220023 is a deficient number, since it is larger than the sum of its proper divisors (228543497).
4330220023 is a wasteful number, since it uses less digits than its factorization.
4330220023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31877.
The product of its (nonzero) digits is 864, while the sum is 19.
The square root of 4330220023 is about 65804.4073220024. The cubic root of 4330220023 is about 1629.9338830497.
Adding to 4330220023 its reverse (3200220334), we get a palindrome (7530440357).
The spelling of 4330220023 in words is "four billion, three hundred thirty million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •