Base | Representation |
---|---|
bin | 1101101100011000001010… |
… | …00110001010000010000101 |
3 | 10221121200121002220101020201 |
4 | 12312030011012022002011 |
5 | 12421324040402243133 |
6 | 144013150333130501 |
7 | 6225345640103062 |
oct | 666140506120205 |
9 | 127550532811221 |
10 | 30112101212293 |
11 | 965a51a128051 |
12 | 3463b15929a31 |
13 | 13a573605ca29 |
14 | 76160d653c69 |
15 | 3734415c7d7d |
hex | 1b630518a085 |
30112101212293 has 2 divisors, whose sum is σ = 30112101212294. Its totient is φ = 30112101212292.
The previous prime is 30112101212261. The next prime is 30112101212311. The reversal of 30112101212293 is 39221210121103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29614253842404 + 497847369889 = 5441898^2 + 705583^2 .
It is a cyclic number.
It is not a de Polignac number, because 30112101212293 - 25 = 30112101212261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30112101216293) 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 as a sum of consecutive naturals, namely, 15056050606146 + 15056050606147.
It is an arithmetic number, because the mean of its divisors is an integer number (15056050606147).
Almost surely, 230112101212293 is an apocalyptic number.
It is an amenable number.
30112101212293 is a deficient number, since it is larger than the sum of its proper divisors (1).
30112101212293 is an equidigital number, since it uses as much as digits as its factorization.
30112101212293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
Adding to 30112101212293 its reverse (39221210121103), we get a palindrome (69333311333396).
The spelling of 30112101212293 in words is "thirty trillion, one hundred twelve billion, one hundred one million, two hundred twelve thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •