Base | Representation |
---|---|
bin | 11011111100110100… |
… | …000010011000000111 |
3 | 2212110112120011202201 |
4 | 123330310002120013 |
5 | 442430343202211 |
6 | 21441554215331 |
7 | 2111464604314 |
oct | 337464023007 |
9 | 85415504681 |
10 | 30011303431 |
11 | 1180066450a |
12 | 5996884547 |
13 | 2aa3822015 |
14 | 1649b4bd0b |
15 | ba9b0d0c1 |
hex | 6fcd02607 |
30011303431 has 8 divisors (see below), whose sum is σ = 30290657760. Its totient is φ = 29732022432.
The previous prime is 30011303429. The next prime is 30011303459. The reversal of 30011303431 is 13430311003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30011303431 - 21 = 30011303429 is a prime.
It is a super-2 number, since 2×300113034312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30011303399 and 30011303408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30011303461) 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 7 ways as a sum of consecutive naturals, for example, 1143846 + ... + 1169788.
It is an arithmetic number, because the mean of its divisors is an integer number (3786332220).
Almost surely, 230011303431 is an apocalyptic number.
30011303431 is a deficient number, since it is larger than the sum of its proper divisors (279354329).
30011303431 is a wasteful number, since it uses less digits than its factorization.
30011303431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36665.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30011303431 its reverse (13430311003), we get a palindrome (43441614434).
The spelling of 30011303431 in words is "thirty billion, eleven million, three hundred three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •