Base | Representation |
---|---|
bin | 1101101111100011000010… |
… | …10110100111011100010101 |
3 | 10222000002202001212100001101 |
4 | 12313301201112213130111 |
5 | 12430120123420311313 |
6 | 144135202453430101 |
7 | 6236253061612321 |
oct | 667614126473425 |
9 | 128002661770041 |
10 | 30221023213333 |
11 | 96a173381a627 |
12 | 348105363b331 |
13 | 13b2aa4110114 |
14 | 7669c35c4981 |
15 | 3761b8c335dd |
hex | 1b7c615a7715 |
30221023213333 has 4 divisors (see below), whose sum is σ = 30247008617088. Its totient is φ = 30195037809580.
The previous prime is 30221023213313. The next prime is 30221023213397. The reversal of 30221023213333 is 33331232012203.
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 30221023213333 - 213 = 30221023205141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221023213313) 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, 12992700133 + ... + 12992702458.
It is an arithmetic number, because the mean of its divisors is an integer number (7561752154272).
Almost surely, 230221023213333 is an apocalyptic number.
It is an amenable number.
30221023213333 is a deficient number, since it is larger than the sum of its proper divisors (25985403755).
30221023213333 is a wasteful number, since it uses less digits than its factorization.
30221023213333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25985403754.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 30221023213333 its reverse (33331232012203), we get a palindrome (63552255225536).
The spelling of 30221023213333 in words is "thirty trillion, two hundred twenty-one billion, twenty-three million, two hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •