Base | Representation |
---|---|
bin | 1101101110111101110001… |
… | …00110010100001110000101 |
3 | 10221221012002110102222011222 |
4 | 12313132320212110032011 |
5 | 12424303133100011323 |
6 | 144122053050210125 |
7 | 6234644143212650 |
oct | 667367046241605 |
9 | 127835073388158 |
10 | 30201012110213 |
11 | 96941a4aa767a |
12 | 34791a9a23945 |
13 | 13b0c353487b9 |
14 | 765a45a4c897 |
15 | 3758e70229c8 |
hex | 1b77b8994385 |
30201012110213 has 32 divisors (see below), whose sum is σ = 35768897256960. Its totient is φ = 24949693440000.
The previous prime is 30201012110209. The next prime is 30201012110221. The reversal of 30201012110213 is 31201121010203.
It is not a de Polignac number, because 30201012110213 - 22 = 30201012110209 is a prime.
It is a super-2 number, since 2×302010121102132 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30201012110191 and 30201012110200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201012110233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 262557713 + ... + 262672713.
It is an arithmetic number, because the mean of its divisors is an integer number (1117778039280).
Almost surely, 230201012110213 is an apocalyptic number.
It is an amenable number.
30201012110213 is a deficient number, since it is larger than the sum of its proper divisors (5567885146747).
30201012110213 is a wasteful number, since it uses less digits than its factorization.
30201012110213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117317.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 30201012110213 its reverse (31201121010203), we get a palindrome (61402133120416).
The spelling of 30201012110213 in words is "thirty trillion, two hundred one billion, twelve million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •