Base | Representation |
---|---|
bin | 1101101110111101111111… |
… | …10000001010011100000111 |
3 | 10221221012101211021201021011 |
4 | 12313132333300022130013 |
5 | 12424303404311211403 |
6 | 144122113014503051 |
7 | 6234650131325002 |
oct | 667367760123407 |
9 | 127835354251234 |
10 | 30201132132103 |
11 | 9694256823919 |
12 | 3479222064a87 |
13 | 13b0c5417c67a |
14 | 765a57972539 |
15 | 37590282ea6d |
hex | 1b77bfc0a707 |
30201132132103 has 4 divisors (see below), whose sum is σ = 30201143181768. Its totient is φ = 30201121082440.
The previous prime is 30201132132047. The next prime is 30201132132113. The reversal of 30201132132103 is 30123123110203.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 30201132132103 - 221 = 30201130034951 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30201132132113) 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, 1910400 + ... + 8003242.
It is an arithmetic number, because the mean of its divisors is an integer number (7550285795442).
Almost surely, 230201132132103 is an apocalyptic number.
30201132132103 is a deficient number, since it is larger than the sum of its proper divisors (11049665).
30201132132103 is an equidigital number, since it uses as much as digits as its factorization.
30201132132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11049664.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30201132132103 its reverse (30123123110203), we get a palindrome (60324255242306).
The spelling of 30201132132103 in words is "thirty trillion, two hundred one billion, one hundred thirty-two million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •