Base | Representation |
---|---|
bin | 1101101110111110010100… |
… | …11111100001101001100111 |
3 | 10221221012212101100012201210 |
4 | 12313133022133201221213 |
5 | 12424304241423220403 |
6 | 144122142532522503 |
7 | 6234654450025311 |
oct | 667371237415147 |
9 | 127835771305653 |
10 | 30201312320103 |
11 | 9694339504821 |
12 | 3479272480433 |
13 | 13b0c825baca2 |
14 | 765a738787b1 |
15 | 375913573b03 |
hex | 1b77ca7e1a67 |
30201312320103 has 4 divisors (see below), whose sum is σ = 40268416426808. Its totient is φ = 20134208213400.
The previous prime is 30201312320051. The next prime is 30201312320143. The reversal of 30201312320103 is 30102321310203.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 30201312320103 - 28 = 30201312319847 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 30201312320103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201312320143) 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, 5033552053348 + ... + 5033552053353.
It is an arithmetic number, because the mean of its divisors is an integer number (10067104106702).
Almost surely, 230201312320103 is an apocalyptic number.
30201312320103 is a deficient number, since it is larger than the sum of its proper divisors (10067104106705).
30201312320103 is a wasteful number, since it uses less digits than its factorization.
30201312320103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10067104106704.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 30201312320103 its reverse (30102321310203), we get a palindrome (60303633630306).
The spelling of 30201312320103 in words is "thirty trillion, two hundred one billion, three hundred twelve million, three hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •