Base | Representation |
---|---|
bin | 11011111101111011… |
… | …010111100110010101 |
3 | 2212111211202012011211 |
4 | 123331323113212111 |
5 | 443000140040311 |
6 | 21443503101421 |
7 | 2112112544635 |
oct | 337573274625 |
9 | 85454665154 |
10 | 30030002581 |
11 | 11810176457 |
12 | 59a0ba1871 |
13 | 2aa766b2c7 |
14 | 164c4186c5 |
15 | bab5a3821 |
hex | 6fded7995 |
30030002581 has 4 divisors (see below), whose sum is σ = 30044017792. Its totient is φ = 30015987372.
The previous prime is 30030002573. The next prime is 30030002609. The reversal of 30030002581 is 18520003003.
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, and also an emirpimes, since its reverse is a distinct semiprime: 18520003003 = 10979 ⋅1686857.
It is a cyclic number.
It is not a de Polignac number, because 30030002581 - 23 = 30030002573 is a prime.
It is a super-2 number, since 2×300300025812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30030072581) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7004391 + ... + 7008676.
It is an arithmetic number, because the mean of its divisors is an integer number (7511004448).
Almost surely, 230030002581 is an apocalyptic number.
It is an amenable number.
30030002581 is a deficient number, since it is larger than the sum of its proper divisors (14015211).
30030002581 is a wasteful number, since it uses less digits than its factorization.
30030002581 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14015210.
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 30030002581 its reverse (18520003003), we get a palindrome (48550005584).
The spelling of 30030002581 in words is "thirty billion, thirty million, two thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •