Base | Representation |
---|---|
bin | 1101101010000101011011… |
… | …11101110101010110010101 |
3 | 10221100011021101222020212202 |
4 | 12311002231331311112111 |
5 | 12414031224440020201 |
6 | 143513042112454245 |
7 | 6216556625622524 |
oct | 665025575652625 |
9 | 127304241866782 |
10 | 30033330001301 |
11 | 962a077900380 |
12 | 34507b154a385 |
13 | 139b19168c103 |
14 | 75b899b804bb |
15 | 371380e2ec6b |
hex | 1b50adf75595 |
30033330001301 has 4 divisors (see below), whose sum is σ = 32763632728704. Its totient is φ = 27303027273900.
The previous prime is 30033330001291. The next prime is 30033330001307. The reversal of 30033330001301 is 10310003333003.
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 not a de Polignac number, because 30033330001301 - 218 = 30033329739157 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30033330001307) 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, 1365151363685 + ... + 1365151363706.
It is an arithmetic number, because the mean of its divisors is an integer number (8190908182176).
Almost surely, 230033330001301 is an apocalyptic number.
It is an amenable number.
30033330001301 is a deficient number, since it is larger than the sum of its proper divisors (2730302727403).
30033330001301 is a wasteful number, since it uses less digits than its factorization.
30033330001301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2730302727402.
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 30033330001301 its reverse (10310003333003), we get a palindrome (40343333334304).
The spelling of 30033330001301 in words is "thirty trillion, thirty-three billion, three hundred thirty million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •