Base | Representation |
---|---|
bin | 1101101001010001010100… |
… | …11111011001110011101101 |
3 | 10221020111001201221201110011 |
4 | 12310220222133121303231 |
5 | 12413101431211430401 |
6 | 143452134114413221 |
7 | 6214546440155545 |
oct | 664505237316355 |
9 | 127214051851404 |
10 | 30005354405101 |
11 | 9619221361939 |
12 | 34472a4591211 |
13 | 13986538370aa |
14 | 75a3a4544325 |
15 | 370794dd9451 |
hex | 1b4a2a7d9ced |
30005354405101 has 2 divisors, whose sum is σ = 30005354405102. Its totient is φ = 30005354405100.
The previous prime is 30005354405087. The next prime is 30005354405141. The reversal of 30005354405101 is 10150445350003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25697052239076 + 4308302166025 = 5069226^2 + 2075645^2 .
It is a cyclic number.
It is not a de Polignac number, because 30005354405101 - 219 = 30005353880813 is a prime.
It is a super-2 number, since 2×300053544051012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30005354405141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15002677202550 + 15002677202551.
It is an arithmetic number, because the mean of its divisors is an integer number (15002677202551).
Almost surely, 230005354405101 is an apocalyptic number.
It is an amenable number.
30005354405101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30005354405101 is an equidigital number, since it uses as much as digits as its factorization.
30005354405101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 30005354405101 its reverse (10150445350003), we get a palindrome (40155799755104).
The spelling of 30005354405101 in words is "thirty trillion, five billion, three hundred fifty-four million, four hundred five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •