Base | Representation |
---|---|
bin | 110000010100011000100… |
… | …001110010011010000111 |
3 | 102202102120212100021200001 |
4 | 300110120201302122013 |
5 | 413400210313331330 |
6 | 11021214102302131 |
7 | 461615063526655 |
oct | 60243041623207 |
9 | 12672525307601 |
10 | 3320421230215 |
11 | 1070201248541 |
12 | 45762a427947 |
13 | 1b116439c08b |
14 | b69d024ddd5 |
15 | 5b589b279ca |
hex | 30518872687 |
3320421230215 has 32 divisors (see below), whose sum is σ = 4357559517696. Its totient is φ = 2418001735680.
The previous prime is 3320421230197. The next prime is 3320421230219. The reversal of 3320421230215 is 5120321240233.
It is a happy number.
It is not a de Polignac number, because 3320421230215 - 221 = 3320419133063 is a prime.
It is a super-2 number, since 2×33204212302152 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3320421230219) 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 31 ways as a sum of consecutive naturals, for example, 4088899 + ... + 4833211.
It is an arithmetic number, because the mean of its divisors is an integer number (136173734928).
Almost surely, 23320421230215 is an apocalyptic number.
3320421230215 is a deficient number, since it is larger than the sum of its proper divisors (1037138287481).
3320421230215 is a wasteful number, since it uses less digits than its factorization.
3320421230215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746059.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 3320421230215 its reverse (5120321240233), we get a palindrome (8440742470448).
The spelling of 3320421230215 in words is "three trillion, three hundred twenty billion, four hundred twenty-one million, two hundred thirty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •