Base | Representation |
---|---|
bin | 1101101111100011011010… |
… | …10001100111111011101011 |
3 | 10222000010021000020021222221 |
4 | 12313301231101213323223 |
5 | 12430121031121344321 |
6 | 144135234400454511 |
7 | 6236261041002655 |
oct | 667615521477353 |
9 | 128003230207887 |
10 | 30221223231211 |
11 | 96a1826714a61 |
12 | 34810aa61a437 |
13 | 13b2b066a25ac |
14 | 766a01dad6d5 |
15 | 3761cb592e41 |
hex | 1b7c6d467eeb |
30221223231211 has 8 divisors (see below), whose sum is σ = 30610627937280. Its totient is φ = 29831989964712.
The previous prime is 30221223231209. The next prime is 30221223231253. The reversal of 30221223231211 is 11213232212203.
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 30221223231211 - 21 = 30221223231209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30221223231271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42505045 + ... + 43210198.
It is an arithmetic number, because the mean of its divisors is an integer number (3826328492160).
Almost surely, 230221223231211 is an apocalyptic number.
30221223231211 is a deficient number, since it is larger than the sum of its proper divisors (389404706069).
30221223231211 is an equidigital number, since it uses as much as digits as its factorization.
30221223231211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85719785.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 30221223231211 its reverse (11213232212203), we get a palindrome (41434455443414).
The spelling of 30221223231211 in words is "thirty trillion, two hundred twenty-one billion, two hundred twenty-three million, two hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •