Base | Representation |
---|---|
bin | 1101101111100001101100… |
… | …10011100101111010000001 |
3 | 10222000000212201220010001022 |
4 | 12313300312103211322001 |
5 | 12430112134024002241 |
6 | 144135003054115225 |
7 | 6236226142114115 |
oct | 667606623457201 |
9 | 128000781803038 |
10 | 30220301000321 |
11 | 96a13a3089273 |
12 | 3480a917abb15 |
13 | 13b29ba5c4243 |
14 | 766955707745 |
15 | 37617562454b |
hex | 1b7c364e5e81 |
30220301000321 has 2 divisors, whose sum is σ = 30220301000322. Its totient is φ = 30220301000320.
The previous prime is 30220301000297. The next prime is 30220301000413. The reversal of 30220301000321 is 12300010302203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30016033158721 + 204267841600 = 5478689^2 + 451960^2 .
It is a cyclic number.
It is not a de Polignac number, because 30220301000321 - 226 = 30220233891457 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30220301000321.
It is not a weakly prime, because it can be changed into another prime (30220301000821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15110150500160 + 15110150500161.
It is an arithmetic number, because the mean of its divisors is an integer number (15110150500161).
Almost surely, 230220301000321 is an apocalyptic number.
It is an amenable number.
30220301000321 is a deficient number, since it is larger than the sum of its proper divisors (1).
30220301000321 is an equidigital number, since it uses as much as digits as its factorization.
30220301000321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 30220301000321 its reverse (12300010302203), we get a palindrome (42520311302524).
The spelling of 30220301000321 in words is "thirty trillion, two hundred twenty billion, three hundred one million, three hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •