Base | Representation |
---|---|
bin | 1101101001101101000001… |
… | …00111110110110001000001 |
3 | 10221021220102211111220001122 |
4 | 12310312200213312301001 |
5 | 12413322403113443431 |
6 | 143503033234242025 |
7 | 6215614032140000 |
oct | 664664047666101 |
9 | 127256384456048 |
10 | 30020221234241 |
11 | 9624560296697 |
12 | 344a153426315 |
13 | 1399b828c7304 |
14 | 75adb4bc0c37 |
15 | 370d65195a7b |
hex | 1b4da09f6c41 |
30020221234241 has 10 divisors (see below), whose sum is σ = 35021507573442. Its totient is φ = 25731618198720.
The previous prime is 30020221234219. The next prime is 30020221234243. The reversal of 30020221234241 is 14243212202003.
It can be written as a sum of positive squares in only one way, i.e., 29208663486016 + 811557748225 = 5404504^2 + 900865^2 .
It is not a de Polignac number, because 30020221234241 - 26 = 30020221234177 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30020221234241.
It is not an unprimeable number, because it can be changed into a prime (30020221234243) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6251605520 + ... + 6251610321.
Almost surely, 230020221234241 is an apocalyptic number.
It is an amenable number.
30020221234241 is a deficient number, since it is larger than the sum of its proper divisors (5001286339201).
30020221234241 is an frugal number, since it uses more digits than its factorization.
30020221234241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12503215869 (or 12503215848 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 30020221234241 its reverse (14243212202003), we get a palindrome (44263433436244).
The spelling of 30020221234241 in words is "thirty trillion, twenty billion, two hundred twenty-one million, two hundred thirty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •