Base | Representation |
---|---|
bin | 100101100001111100001010… |
… | …0100100000011100100110101 |
3 | 1121021212011201212001200221110 |
4 | 1023003320110210003210311 |
5 | 321232142002023120201 |
6 | 3130035031243505233 |
7 | 126351251231322642 |
oct | 11303702444034465 |
9 | 1537764655050843 |
10 | 330120121301301 |
11 | 96206180296101 |
12 | 310375a8828219 |
13 | 11228269bbc736 |
14 | 5b73c832a2dc9 |
15 | 28272ae09e6d6 |
hex | 12c3e14903935 |
330120121301301 has 8 divisors (see below), whose sum is σ = 441153751266720. Its totient is φ = 219583286101712.
The previous prime is 330120121301291. The next prime is 330120121301317. The reversal of 330120121301301 is 103103121021033.
It is a happy number.
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 330120121301301 - 226 = 330120054192437 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330120121308301) 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, 124198689906 + ... + 124198692563.
It is an arithmetic number, because the mean of its divisors is an integer number (55144218908340).
Almost surely, 2330120121301301 is an apocalyptic number.
It is an amenable number.
330120121301301 is a deficient number, since it is larger than the sum of its proper divisors (111033629965419).
330120121301301 is a wasteful number, since it uses less digits than its factorization.
330120121301301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248397382915.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 330120121301301 its reverse (103103121021033), we get a palindrome (433223242322334).
The spelling of 330120121301301 in words is "three hundred thirty trillion, one hundred twenty billion, one hundred twenty-one million, three hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •