Base | Representation |
---|---|
bin | 1100010011110100… |
… | …0011101000110111 |
3 | 22112021200212100211 |
4 | 3010331003220313 |
5 | 23231402340043 |
6 | 1303515250251 |
7 | 144612266245 |
oct | 30475035067 |
9 | 8467625324 |
10 | 3304340023 |
11 | 1446239626 |
12 | 782749987 |
13 | 4087718aa |
14 | 234bc9795 |
15 | 14515da9d |
hex | c4f43a37 |
3304340023 has 8 divisors (see below), whose sum is σ = 3318810768. Its totient is φ = 3289891584.
The previous prime is 3304340009. The next prime is 3304340051. The reversal of 3304340023 is 3200434033.
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 3304340023 - 25 = 3304339991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3304339976 and 3304340003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3304140023) 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, 335911 + ... + 345607.
It is an arithmetic number, because the mean of its divisors is an integer number (414851346).
Almost surely, 23304340023 is an apocalyptic number.
3304340023 is a deficient number, since it is larger than the sum of its proper divisors (14470745).
3304340023 is a wasteful number, since it uses less digits than its factorization.
3304340023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11153.
The product of its (nonzero) digits is 2592, while the sum is 22.
The square root of 3304340023 is about 57483.3891050275. The cubic root of 3304340023 is about 1489.4579387922.
Adding to 3304340023 its reverse (3200434033), we get a palindrome (6504774056).
The spelling of 3304340023 in words is "three billion, three hundred four million, three hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •