Base | Representation |
---|---|
bin | 1101101001001011101100… |
… | …11010011011001100110001 |
3 | 10221020012021012000122211102 |
4 | 12310211312122123030301 |
5 | 12413024234244414301 |
6 | 143450514231454145 |
7 | 6214411533311114 |
oct | 664456632331461 |
9 | 127205235018742 |
10 | 30002333201201 |
11 | 9617a10a29709 |
12 | 34467a0827355 |
13 | 139829193a48a |
14 | 75a1991bc57b |
15 | 370669a57b6b |
hex | 1b497669b331 |
30002333201201 has 4 divisors (see below), whose sum is σ = 30003560666352. Its totient is φ = 30001105736052.
The previous prime is 30002333201149. The next prime is 30002333201207. The reversal of 30002333201201 is 10210233320003.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30002333201201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30002333201207) 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, 613695911 + ... + 613744796.
It is an arithmetic number, because the mean of its divisors is an integer number (7500890166588).
Almost surely, 230002333201201 is an apocalyptic number.
It is an amenable number.
30002333201201 is a deficient number, since it is larger than the sum of its proper divisors (1227465151).
30002333201201 is a wasteful number, since it uses less digits than its factorization.
30002333201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1227465150.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30002333201201 its reverse (10210233320003), we get a palindrome (40212566521204).
The spelling of 30002333201201 in words is "thirty trillion, two billion, three hundred thirty-three million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •