Base | Representation |
---|---|
bin | 1101101001011010011011… |
… | …10001001000110000100001 |
3 | 10221020221200022100211100002 |
4 | 12310231031301020300201 |
5 | 12413141433223124323 |
6 | 143454303044105345 |
7 | 6215111516351252 |
oct | 664551561106041 |
9 | 127227608324302 |
10 | 30010241223713 |
11 | 96202a9895003 |
12 | 3448229095255 |
13 | 1398c520b853a |
14 | 75a709582b29 |
15 | 37097de35828 |
hex | 1b4b4dc48c21 |
30010241223713 has 2 divisors, whose sum is σ = 30010241223714. Its totient is φ = 30010241223712.
The previous prime is 30010241223679. The next prime is 30010241223719. The reversal of 30010241223713 is 31732214201003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29781653964049 + 228587259664 = 5457257^2 + 478108^2 .
It is a cyclic number.
It is not a de Polignac number, because 30010241223713 - 230 = 30009167481889 is a prime.
It is a super-2 number, since 2×300102412237132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30010241223719) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15005120611856 + 15005120611857.
It is an arithmetic number, because the mean of its divisors is an integer number (15005120611857).
Almost surely, 230010241223713 is an apocalyptic number.
It is an amenable number.
30010241223713 is a deficient number, since it is larger than the sum of its proper divisors (1).
30010241223713 is an equidigital number, since it uses as much as digits as its factorization.
30010241223713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 30010241223713 its reverse (31732214201003), we get a palindrome (61742455424716).
The spelling of 30010241223713 in words is "thirty trillion, ten billion, two hundred forty-one million, two hundred twenty-three thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •