Base | Representation |
---|---|
bin | 100101100011010001010101… |
… | …0110010001000101101110001 |
3 | 1121022111122212002102112200110 |
4 | 1023012202222302020231301 |
5 | 321243141101212414301 |
6 | 3130255041200211533 |
7 | 126400415001321531 |
oct | 11306425262105561 |
9 | 1538448762375613 |
10 | 330303030201201 |
11 | 96276801625892 |
12 | 31066b34609ba9 |
13 | 1123c59939c915 |
14 | 5b7ca7554d4c1 |
15 | 282be16d540d6 |
hex | 12c68aac88b71 |
330303030201201 has 4 divisors (see below), whose sum is σ = 440404040268272. Its totient is φ = 220202020134132.
The previous prime is 330303030201169. The next prime is 330303030201223. The reversal of 330303030201201 is 102102030303033.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 330303030201201 - 25 = 330303030201169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330303030201241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 55050505033531 + ... + 55050505033536.
It is an arithmetic number, because the mean of its divisors is an integer number (110101010067068).
Almost surely, 2330303030201201 is an apocalyptic number.
It is an amenable number.
330303030201201 is a deficient number, since it is larger than the sum of its proper divisors (110101010067071).
330303030201201 is a wasteful number, since it uses less digits than its factorization.
330303030201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110101010067070.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 330303030201201 its reverse (102102030303033), we get a palindrome (432405060504234).
The spelling of 330303030201201 in words is "three hundred thirty trillion, three hundred three billion, thirty million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •