Base | Representation |
---|---|
bin | 1101101100010110101110… |
… | …01000010101111010100001 |
3 | 10221121121121100210102120021 |
4 | 12312023113020111322201 |
5 | 12421321000442031223 |
6 | 144012542024113441 |
7 | 6225320554144624 |
oct | 666132710257241 |
9 | 127547540712507 |
10 | 30111330033313 |
11 | 965a163891951 |
12 | 346393b605881 |
13 | 13a564235b2c9 |
14 | 76157906bdbb |
15 | 3733e8a4565d |
hex | 1b62d7215ea1 |
30111330033313 has 8 divisors (see below), whose sum is σ = 30140692499840. Its totient is φ = 30081968302320.
The previous prime is 30111330033287. The next prime is 30111330033341. The reversal of 30111330033313 is 31333003311103.
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 30111330033313 - 213 = 30111330025121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30111330033013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 119605498 + ... + 119856988.
It is an arithmetic number, because the mean of its divisors is an integer number (3767586562480).
Almost surely, 230111330033313 is an apocalyptic number.
It is an amenable number.
30111330033313 is a deficient number, since it is larger than the sum of its proper divisors (29362466527).
30111330033313 is a wasteful number, since it uses less digits than its factorization.
30111330033313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367767.
The product of its (nonzero) digits is 2187, while the sum is 25.
Adding to 30111330033313 its reverse (31333003311103), we get a palindrome (61444333344416).
The spelling of 30111330033313 in words is "thirty trillion, one hundred eleven billion, three hundred thirty million, thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •