Base | Representation |
---|---|
bin | 111001100000… |
… | …1100000111001 |
3 | 2002201220210221 |
4 | 1303001200321 |
5 | 30204342021 |
6 | 2554140041 |
7 | 514202632 |
oct | 163014071 |
9 | 62656727 |
10 | 30152761 |
11 | 16025241 |
12 | a121621 |
13 | 6329692 |
14 | 400c889 |
15 | 29a9241 |
hex | 1cc1839 |
30152761 has 4 divisors (see below), whose sum is σ = 30854032. Its totient is φ = 29451492.
The previous prime is 30152657. The next prime is 30152767. The reversal of 30152761 is 16725103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30152761 - 29 = 30152249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30152767) 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 3 ways as a sum of consecutive naturals, for example, 350571 + ... + 350656.
It is an arithmetic number, because the mean of its divisors is an integer number (7713508).
Almost surely, 230152761 is an apocalyptic number.
It is an amenable number.
30152761 is a deficient number, since it is larger than the sum of its proper divisors (701271).
30152761 is an equidigital number, since it uses as much as digits as its factorization.
30152761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 701270.
The product of its (nonzero) digits is 1260, while the sum is 25.
The square root of 30152761 is about 5491.1529754688. The cubic root of 30152761 is about 311.2497623155.
Adding to 30152761 its reverse (16725103), we get a palindrome (46877864).
It can be divided in two parts, 3015 and 2761, that added together give a square (5776 = 762).
The spelling of 30152761 in words is "thirty million, one hundred fifty-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •