Base | Representation |
---|---|
bin | 1101101100000111100101… |
… | …01110111110111110011011 |
3 | 10221120211121222202012012011 |
4 | 12312003302232332332123 |
5 | 12421202330010310321 |
6 | 144005115354130351 |
7 | 6224612303256562 |
oct | 666036256767633 |
9 | 127524558665164 |
10 | 30103203213211 |
11 | 96567734746a7 |
12 | 3462251a209b7 |
13 | 13a4948773c0b |
14 | 7610079d0bd9 |
15 | 3730c0348ae1 |
hex | 1b60f2bbef9b |
30103203213211 has 8 divisors (see below), whose sum is σ = 30671854567200. Its totient is φ = 29534576540352.
The previous prime is 30103203213203. The next prime is 30103203213229. The reversal of 30103203213211 is 11231230230103.
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 30103203213211 - 23 = 30103203213203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30103203213241) 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, 3698610 + ... + 8595703.
It is an arithmetic number, because the mean of its divisors is an integer number (3833981820900).
Almost surely, 230103203213211 is an apocalyptic number.
30103203213211 is a deficient number, since it is larger than the sum of its proper divisors (568651353989).
30103203213211 is a wasteful number, since it uses less digits than its factorization.
30103203213211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12340565.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30103203213211 its reverse (11231230230103), we get a palindrome (41334433443314).
The spelling of 30103203213211 in words is "thirty trillion, one hundred three billion, two hundred three million, two hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •