Base | Representation |
---|---|
bin | 1101110000110111010000… |
… | …01100000011000110001101 |
3 | 10222011102102221220002212101 |
4 | 12320123220030003012031 |
5 | 12431340222132241031 |
6 | 144212041052035101 |
7 | 6242443343033422 |
oct | 670335014030615 |
9 | 128142387802771 |
10 | 30266235040141 |
11 | 9709924706251 |
12 | 3489970a62a91 |
13 | 13b712ab89769 |
14 | 768c72033d49 |
15 | 377463065361 |
hex | 1b86e830318d |
30266235040141 has 2 divisors, whose sum is σ = 30266235040142. Its totient is φ = 30266235040140.
The previous prime is 30266235040079. The next prime is 30266235040213. The reversal of 30266235040141 is 14104053266203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20004598022500 + 10261637017641 = 4472650^2 + 3203379^2 .
It is an emirp because it is prime and its reverse (14104053266203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30266235040141 - 215 = 30266235007373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30266235040141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30266235040441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15133117520070 + 15133117520071.
It is an arithmetic number, because the mean of its divisors is an integer number (15133117520071).
Almost surely, 230266235040141 is an apocalyptic number.
It is an amenable number.
30266235040141 is a deficient number, since it is larger than the sum of its proper divisors (1).
30266235040141 is an equidigital number, since it uses as much as digits as its factorization.
30266235040141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 103680, while the sum is 37.
The spelling of 30266235040141 in words is "thirty trillion, two hundred sixty-six billion, two hundred thirty-five million, forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •