Base | Representation |
---|---|
bin | 1101101110111110001111… |
… | …01111101000010110011011 |
3 | 10221221012202011120120211201 |
4 | 12313133013233220112123 |
5 | 12424304143122211303 |
6 | 144122134204335031 |
7 | 6234653350062154 |
oct | 667370757502633 |
9 | 127835664516751 |
10 | 30201266210203 |
11 | 9694315480770 |
12 | 347925ab44477 |
13 | 13b0c75b9541a |
14 | 765a6b6b492b |
15 | 37590e4b681d |
hex | 1b77c7be859b |
30201266210203 has 8 divisors (see below), whose sum is σ = 33286493968560. Its totient is φ = 27172648135680.
The previous prime is 30201266210197. The next prime is 30201266210231.
30201266210203 is nontrivially palindromic in base 10.
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 30201266210203 - 213 = 30201266202011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30201266210273) 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, 14152419838 + ... + 14152421971.
It is an arithmetic number, because the mean of its divisors is an integer number (4160811746070).
Almost surely, 230201266210203 is an apocalyptic number.
30201266210203 is a deficient number, since it is larger than the sum of its proper divisors (3085227758357).
30201266210203 is a wasteful number, since it uses less digits than its factorization.
30201266210203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28304841917.
The product of its (nonzero) digits is 5184, while the sum is 28.
It can be divided in two parts, 3020126 and 6210203, that added together give a palindrome (9230329).
The spelling of 30201266210203 in words is "thirty trillion, two hundred one billion, two hundred sixty-six million, two hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •