Base | Representation |
---|---|
bin | 11011111111001100… |
… | …111001101000000001 |
3 | 2212120022222001110202 |
4 | 123333030321220001 |
5 | 443021123004432 |
6 | 21445545134545 |
7 | 2112462322664 |
oct | 337714715001 |
9 | 85508861422 |
10 | 30051375617 |
11 | 1182124431a |
12 | 59a818a455 |
13 | 2aabc12683 |
14 | 16511bd6db |
15 | bad3c6462 |
hex | 6ff339a01 |
30051375617 has 4 divisors (see below), whose sum is σ = 30863574996. Its totient is φ = 29239176240.
The previous prime is 30051375589. The next prime is 30051375623. The reversal of 30051375617 is 71657315003.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 18220680256 + 11830695361 = 134984^2 + 108769^2 .
It is a cyclic number.
It is not a de Polignac number, because 30051375617 - 224 = 30034598401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30051375667) 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 3 ways as a sum of consecutive naturals, for example, 406099634 + ... + 406099707.
It is an arithmetic number, because the mean of its divisors is an integer number (7715893749).
Almost surely, 230051375617 is an apocalyptic number.
30051375617 is a gapful number since it is divisible by the number (37) formed by its first and last digit.
It is an amenable number.
30051375617 is a deficient number, since it is larger than the sum of its proper divisors (812199379).
30051375617 is an equidigital number, since it uses as much as digits as its factorization.
30051375617 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812199378.
The product of its (nonzero) digits is 66150, while the sum is 38.
The spelling of 30051375617 in words is "thirty billion, fifty-one million, three hundred seventy-five thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •