Base | Representation |
---|---|
bin | 11100001110000001… |
… | …111011010011110101 |
3 | 2220012200002110121110 |
4 | 130032001323103311 |
5 | 444023320012143 |
6 | 21530353305233 |
7 | 2121603041436 |
oct | 341601732365 |
9 | 86180073543 |
10 | 30300157173 |
11 | 11939715610 |
12 | 5a57565219 |
13 | 2b1b6195b0 |
14 | 167625d48d |
15 | bc5169533 |
hex | 70e07b4f5 |
30300157173 has 64 divisors (see below), whose sum is σ = 48099889152. Its totient is φ = 16725070080.
The previous prime is 30300157157. The next prime is 30300157177. The reversal of 30300157173 is 37175100303.
It is not a de Polignac number, because 30300157173 - 24 = 30300157157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30300157173.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30300157177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12713940 + ... + 12716322.
It is an arithmetic number, because the mean of its divisors is an integer number (751560768).
Almost surely, 230300157173 is an apocalyptic number.
30300157173 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
30300157173 is a deficient number, since it is larger than the sum of its proper divisors (17799731979).
30300157173 is a wasteful number, since it uses less digits than its factorization.
30300157173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2794.
The product of its (nonzero) digits is 6615, while the sum is 30.
Adding to 30300157173 its reverse (37175100303), we get a palindrome (67475257476).
The spelling of 30300157173 in words is "thirty billion, three hundred million, one hundred fifty-seven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •