Base | Representation |
---|---|
bin | 11100000011111000… |
… | …111000000010110111 |
3 | 2212202210221012210002 |
4 | 130003320320002313 |
5 | 443201240343333 |
6 | 21501434421515 |
7 | 2114435610404 |
oct | 340370700267 |
9 | 85683835702 |
10 | 30130012343 |
11 | 11861674252 |
12 | 5a0a59189b |
13 | 2ac22b6392 |
14 | 165b80d2ab |
15 | bb525b0e8 |
hex | 703e380b7 |
30130012343 has 4 divisors (see below), whose sum is σ = 30130397160. Its totient is φ = 30129627528.
The previous prime is 30130012291. The next prime is 30130012379. The reversal of 30130012343 is 34321003103.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 34321003103 = 59 ⋅581711917.
It is a cyclic number.
It is not a de Polignac number, because 30130012343 - 222 = 30125818039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30130011343) 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, 28313 + ... + 247106.
It is an arithmetic number, because the mean of its divisors is an integer number (7532599290).
Almost surely, 230130012343 is an apocalyptic number.
30130012343 is a deficient number, since it is larger than the sum of its proper divisors (384817).
30130012343 is a wasteful number, since it uses less digits than its factorization.
30130012343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384816.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30130012343 its reverse (34321003103), we get a palindrome (64451015446).
The spelling of 30130012343 in words is "thirty billion, one hundred thirty million, twelve thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •