Base | Representation |
---|---|
bin | 1101110011010011011111… |
… | …11101100100110110100001 |
3 | 10222110102221212012202012102 |
4 | 12321221233331210312201 |
5 | 12434224020013414431 |
6 | 144314352412340145 |
7 | 6251503125511406 |
oct | 671515775446641 |
9 | 128412855182172 |
10 | 30350117326241 |
11 | 974145a006339 |
12 | 34a2080a74655 |
13 | 13c200840978b |
14 | 76cd4c6402ad |
15 | 3797222a5dcb |
hex | 1b9a6ff64da1 |
30350117326241 has 2 divisors, whose sum is σ = 30350117326242. Its totient is φ = 30350117326240.
The previous prime is 30350117326231. The next prime is 30350117326343. The reversal of 30350117326241 is 14262371105303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24805340406016 + 5544776920225 = 4980496^2 + 2354735^2 .
It is a cyclic number.
It is not a de Polignac number, because 30350117326241 - 214 = 30350117309857 is a prime.
It is a super-2 number, since 2×303501173262412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30350117326195 and 30350117326204.
It is not a weakly prime, because it can be changed into another prime (30350117326231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15175058663120 + 15175058663121.
It is an arithmetic number, because the mean of its divisors is an integer number (15175058663121).
Almost surely, 230350117326241 is an apocalyptic number.
It is an amenable number.
30350117326241 is a deficient number, since it is larger than the sum of its proper divisors (1).
30350117326241 is an equidigital number, since it uses as much as digits as its factorization.
30350117326241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 38.
The spelling of 30350117326241 in words is "thirty trillion, three hundred fifty billion, one hundred seventeen million, three hundred twenty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •