Base | Representation |
---|---|
bin | 11100010100110101… |
… | …000111110101110101 |
3 | 2220111121202112101121 |
4 | 130110311013311311 |
5 | 444242021204031 |
6 | 21545550423541 |
7 | 2124456532654 |
oct | 342465076565 |
9 | 86447675347 |
10 | 30414241141 |
11 | 11998056589 |
12 | 5a89801bb1 |
13 | 2b391517bb |
14 | 168747919b |
15 | bd01a2011 |
hex | 714d47d75 |
30414241141 has 8 divisors (see below), whose sum is σ = 30451503384. Its totient is φ = 30377003520.
The previous prime is 30414241139. The next prime is 30414241159. The reversal of 30414241141 is 14114241403.
It can be written as a sum of positive squares in 4 ways, for example, as 10123378225 + 20290862916 = 100615^2 + 142446^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30414241141 - 21 = 30414241139 is a prime.
It is a super-3 number, since 3×304142411413 (a number of 32 digits) contains 333 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 (30414241181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3688275 + ... + 3696511.
It is an arithmetic number, because the mean of its divisors is an integer number (3806437923).
Almost surely, 230414241141 is an apocalyptic number.
It is an amenable number.
30414241141 is a deficient number, since it is larger than the sum of its proper divisors (37262243).
30414241141 is a wasteful number, since it uses less digits than its factorization.
30414241141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12311.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 30414241141 its reverse (14114241403), we get a palindrome (44528482544).
The spelling of 30414241141 in words is "thirty billion, four hundred fourteen million, two hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •