Base | Representation |
---|---|
bin | 1001101110000111111… |
… | …00111001010100001011 |
3 | 1011221010000221002202010 |
4 | 10313003330321110023 |
5 | 20433013000033230 |
6 | 413234255111003 |
7 | 33062555114460 |
oct | 4670374712413 |
9 | 1157100832663 |
10 | 334000002315 |
11 | 119715326271 |
12 | 54893b12463 |
13 | 2565ab16485 |
14 | 12246901667 |
15 | 8a4c55d9b0 |
hex | 4dc3f3950b |
334000002315 has 32 divisors (see below), whose sum is σ = 610775953920. Its totient is φ = 152677442304.
The previous prime is 334000002263. The next prime is 334000002319. The reversal of 334000002315 is 513200000433.
It is not a de Polignac number, because 334000002315 - 213 = 333999994123 is a prime.
It is a super-2 number, since 2×3340000023152 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 334000002291 and 334000002300.
It is not an unprimeable number, because it can be changed into a prime (334000002319) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2131327 + ... + 2282663.
It is an arithmetic number, because the mean of its divisors is an integer number (19086748560).
Almost surely, 2334000002315 is an apocalyptic number.
334000002315 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
334000002315 is a deficient number, since it is larger than the sum of its proper divisors (276775951605).
334000002315 is a wasteful number, since it uses less digits than its factorization.
334000002315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172371.
The product of its (nonzero) digits is 1080, while the sum is 21.
Adding to 334000002315 its reverse (513200000433), we get a palindrome (847200002748).
The spelling of 334000002315 in words is "three hundred thirty-four billion, two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •