Base | Representation |
---|---|
bin | 1101101111010000101111… |
… | …11010100111010000111011 |
3 | 10221222011101120000102101122 |
4 | 12313220113322213100323 |
5 | 12424440020001414321 |
6 | 144130500105535455 |
7 | 6235454505105422 |
oct | 667502772472073 |
9 | 127864346012348 |
10 | 30211201201211 |
11 | 9698553523538 |
12 | 347b1721a458b |
13 | 13b1b9a270a24 |
14 | 766330d542b9 |
15 | 375ce17d28ab |
hex | 1b7a17ea743b |
30211201201211 has 4 divisors (see below), whose sum is σ = 30211254064992. Its totient is φ = 30211148337432.
The previous prime is 30211201201201. The next prime is 30211201201283. The reversal of 30211201201211 is 11210210211203.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30211201201211 - 230 = 30210127459387 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30211201201211.
It is not an unprimeable number, because it can be changed into a prime (30211201201201) 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, 25565180 + ... + 26720793.
It is an arithmetic number, because the mean of its divisors is an integer number (7552813516248).
Almost surely, 230211201201211 is an apocalyptic number.
30211201201211 is a deficient number, since it is larger than the sum of its proper divisors (52863781).
30211201201211 is an equidigital number, since it uses as much as digits as its factorization.
30211201201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52863780.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 30211201201211 its reverse (11210210211203), we get a palindrome (41421411412414).
The spelling of 30211201201211 in words is "thirty trillion, two hundred eleven billion, two hundred one million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •