Base | Representation |
---|---|
bin | 11100000011111101… |
… | …001100000101011001 |
3 | 2212202220001122202022 |
4 | 130003331030011121 |
5 | 443202033034001 |
6 | 21501514544225 |
7 | 2114451326651 |
oct | 340375140531 |
9 | 85686048668 |
10 | 30131143001 |
11 | 11862276783 |
12 | 5a0aa38075 |
13 | 2ac25c0bcb |
14 | 165ba25361 |
15 | bb53d111b |
hex | 703f4c159 |
30131143001 has 4 divisors (see below), whose sum is σ = 30641840400. Its totient is φ = 29620445604.
The previous prime is 30131142953. The next prime is 30131143013. The reversal of 30131143001 is 10034113103.
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 a de Polignac number, because none of the positive numbers 2k-30131143001 is a prime.
It is a super-2 number, since 2×301311430012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30101143001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255348611 + ... + 255348728.
It is an arithmetic number, because the mean of its divisors is an integer number (7660460100).
Almost surely, 230131143001 is an apocalyptic number.
It is an amenable number.
30131143001 is a deficient number, since it is larger than the sum of its proper divisors (510697399).
30131143001 is an equidigital number, since it uses as much as digits as its factorization.
30131143001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510697398.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 30131143001 its reverse (10034113103), we get a palindrome (40165256104).
The spelling of 30131143001 in words is "thirty billion, one hundred thirty-one million, one hundred forty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •