Base | Representation |
---|---|
bin | 11100001001111111… |
… | …111101110001111101 |
3 | 2220000221211212020201 |
4 | 130021333331301331 |
5 | 443404012043031 |
6 | 21515540043501 |
7 | 2120122204645 |
oct | 341177756175 |
9 | 86027755221 |
10 | 30232534141 |
11 | 11904528407 |
12 | 5a38993591 |
13 | 2b0a600974 |
14 | 166b299525 |
15 | bbe25cd61 |
hex | 709ffdc7d |
30232534141 has 4 divisors (see below), whose sum is σ = 30233398432. Its totient is φ = 30231669852.
The previous prime is 30232534099. The next prime is 30232534153. The reversal of 30232534141 is 14143523203.
It is a happy number.
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: 14143523203 = 163 ⋅86770081.
It is a cyclic number.
It is not a de Polignac number, because 30232534141 - 213 = 30232525949 is a prime.
It is a super-2 number, since 2×302325341412 (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 (30232531141) 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, 377361 + ... + 450406.
It is an arithmetic number, because the mean of its divisors is an integer number (7558349608).
Almost surely, 230232534141 is an apocalyptic number.
It is an amenable number.
30232534141 is a deficient number, since it is larger than the sum of its proper divisors (864291).
30232534141 is an equidigital number, since it uses as much as digits as its factorization.
30232534141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 864290.
The product of its (nonzero) digits is 8640, while the sum is 28.
The spelling of 30232534141 in words is "thirty billion, two hundred thirty-two million, five hundred thirty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •