Base | Representation |
---|---|
bin | 110000010100000110101… |
… | …001101010000100000101 |
3 | 102202101210221222102021211 |
4 | 300110012221222010011 |
5 | 413344102023201201 |
6 | 11021124230011421 |
7 | 461604462303325 |
oct | 60240651520405 |
9 | 12671727872254 |
10 | 3320121303301 |
11 | 1070067a13a60 |
12 | 457565aa6b71 |
13 | 1b11171c862a |
14 | b69a2499285 |
15 | 5b56d630651 |
hex | 30506a6a105 |
3320121303301 has 8 divisors (see below), whose sum is σ = 3676009476384. Its totient is φ = 2973242957520.
The previous prime is 3320121303287. The next prime is 3320121303361. The reversal of 3320121303301 is 1033031210233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3320121303301 - 27 = 3320121303173 is a prime.
It is a super-2 number, since 2×33201213033012 (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 (3320121303361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2252456050 + ... + 2252457523.
It is an arithmetic number, because the mean of its divisors is an integer number (459501184548).
Almost surely, 23320121303301 is an apocalyptic number.
It is an amenable number.
3320121303301 is a deficient number, since it is larger than the sum of its proper divisors (355888173083).
3320121303301 is a wasteful number, since it uses less digits than its factorization.
3320121303301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4504913651.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3320121303301 its reverse (1033031210233), we get a palindrome (4353152513534).
The spelling of 3320121303301 in words is "three trillion, three hundred twenty billion, one hundred twenty-one million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •