Base | Representation |
---|---|
bin | 11100011010011001… |
… | …000100100000100001 |
3 | 2220202010100011010011 |
4 | 130122121010200201 |
5 | 444434413111003 |
6 | 22003122404521 |
7 | 2130001621441 |
oct | 343231044041 |
9 | 86663304104 |
10 | 30507550753 |
11 | 11a35798469 |
12 | 5ab4b00741 |
13 | 2b52591ca4 |
14 | 1695a08121 |
15 | bd848446d |
hex | 71a644821 |
30507550753 has 8 divisors (see below), whose sum is σ = 32307928488. Its totient is φ = 28707819264.
The previous prime is 30507550693. The next prime is 30507550757. The reversal of 30507550753 is 35705570503.
It can be written as a sum of positive squares in 4 ways, for example, as 22822749184 + 7684801569 = 151072^2 + 87663^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30507550753 - 225 = 30473996321 is a prime.
It is a super-3 number, since 3×305075507533 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30507550757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62626 + ... + 254827.
It is an arithmetic number, because the mean of its divisors is an integer number (4038491061).
Almost surely, 230507550753 is an apocalyptic number.
It is an amenable number.
30507550753 is a deficient number, since it is larger than the sum of its proper divisors (1800377735).
30507550753 is a wasteful number, since it uses less digits than its factorization.
30507550753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323123.
The product of its (nonzero) digits is 275625, while the sum is 40.
The spelling of 30507550753 in words is "thirty billion, five hundred seven million, five hundred fifty thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •