Base | Representation |
---|---|
bin | 1001111100111110… |
… | …01001100100001111 |
3 | 111210101101210112011 |
4 | 10332133021210033 |
5 | 41420342222320 |
6 | 2242113522051 |
7 | 246261321253 |
oct | 47637114417 |
9 | 14711353464 |
10 | 5343320335 |
11 | 22a218a721 |
12 | 1051573327 |
13 | 672016612 |
14 | 389910263 |
15 | 21417105a |
hex | 13e7c990f |
5343320335 has 4 divisors (see below), whose sum is σ = 6411984408. Its totient is φ = 4274656264.
The previous prime is 5343320321. The next prime is 5343320341. The reversal of 5343320335 is 5330233435.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5330233435 = 5 ⋅1066046687.
It is a cyclic number.
It is not a de Polignac number, because 5343320335 - 27 = 5343320207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5343320297 and 5343320306.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 534332029 + ... + 534332038.
It is an arithmetic number, because the mean of its divisors is an integer number (1602996102).
Almost surely, 25343320335 is an apocalyptic number.
5343320335 is a deficient number, since it is larger than the sum of its proper divisors (1068664073).
5343320335 is a wasteful number, since it uses less digits than its factorization.
5343320335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1068664072.
The product of its (nonzero) digits is 48600, while the sum is 31.
The square root of 5343320335 is about 73098.0186803993. The cubic root of 5343320335 is about 1748.2508056629.
The spelling of 5343320335 in words is "five billion, three hundred forty-three million, three hundred twenty thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •