Base | Representation |
---|---|
bin | 111001010100… |
… | …0100011000101 |
3 | 2002112201112112 |
4 | 1302220203011 |
5 | 30143104001 |
6 | 2552030405 |
7 | 513265535 |
oct | 162504305 |
9 | 62481475 |
10 | 30050501 |
11 | 15a65428 |
12 | a092405 |
13 | 62c1c80 |
14 | 3dc34c5 |
15 | 2988cbb |
hex | 1ca88c5 |
30050501 has 8 divisors (see below), whose sum is σ = 33406464. Its totient is φ = 26843760.
The previous prime is 30050479. The next prime is 30050513. The reversal of 30050501 is 10505003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30050501 is a prime.
It is a super-2 number, since 2×300505012 = 1806065220702002, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30050551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36881 + ... + 37686.
It is an arithmetic number, because the mean of its divisors is an integer number (4175808).
Almost surely, 230050501 is an apocalyptic number.
30050501 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
30050501 is a deficient number, since it is larger than the sum of its proper divisors (3355963).
30050501 is a wasteful number, since it uses less digits than its factorization.
30050501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74611.
The product of its (nonzero) digits is 75, while the sum is 14.
The square root of 30050501 is about 5481.8337260446. The cubic root of 30050501 is about 310.8975065739.
Adding to 30050501 its reverse (10505003), we get a palindrome (40555504).
The spelling of 30050501 in words is "thirty million, fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •