Base | Representation |
---|---|
bin | 11100011111010110… |
… | …111101101010011011 |
3 | 2220221221010221112111 |
4 | 130133112331222123 |
5 | 1000122231301012 |
6 | 22015300453151 |
7 | 2132033141131 |
oct | 343726755233 |
9 | 86857127474 |
10 | 30590884507 |
11 | 11a78836337 |
12 | 5b189aa1b7 |
13 | 2b6691b8c1 |
14 | 16a2adb751 |
15 | be0945ba7 |
hex | 71f5bda9b |
30590884507 has 4 divisors (see below), whose sum is σ = 32200931080. Its totient is φ = 28980837936.
The previous prime is 30590884439. The next prime is 30590884543. The reversal of 30590884507 is 70548809503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30590884507 is a prime.
It is a super-2 number, since 2×305908845072 (a number of 22 digits) contains 22 as substring.
It is the 174903-rd Hogben number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30590884547) by changing a digit.
It is a nontrivial repunit in base 174902.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 805023258 + ... + 805023295.
It is an arithmetic number, because the mean of its divisors is an integer number (8050232770).
Almost surely, 230590884507 is an apocalyptic number.
30590884507 is a deficient number, since it is larger than the sum of its proper divisors (1610046573).
30590884507 is a wasteful number, since it uses less digits than its factorization.
30590884507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1610046572.
The product of its (nonzero) digits is 1209600, while the sum is 49.
The spelling of 30590884507 in words is "thirty billion, five hundred ninety million, eight hundred eighty-four thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •