Base | Representation |
---|---|
bin | 1101101100010100101011… |
… | …00101001100011000101001 |
3 | 10221121111202201110012100021 |
4 | 12312022111211030120221 |
5 | 12421311222424101301 |
6 | 144012240541040441 |
7 | 6225251401442632 |
oct | 666122545143051 |
9 | 127544681405307 |
10 | 30110230300201 |
11 | 965974a03a107 |
12 | 3463693256121 |
13 | 13a54c8571c5c |
14 | 7614b2d9c889 |
15 | 3733822138a1 |
hex | 1b629594c629 |
30110230300201 has 2 divisors, whose sum is σ = 30110230300202. Its totient is φ = 30110230300200.
The previous prime is 30110230300147. The next prime is 30110230300231. The reversal of 30110230300201 is 10200303201103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29807013776400 + 303216523801 = 5459580^2 + 550651^2 .
It is a cyclic number.
It is not a de Polignac number, because 30110230300201 - 233 = 30101640365609 is a prime.
It is a super-2 number, since 2×301102303002012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30110230300231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15055115150100 + 15055115150101.
It is an arithmetic number, because the mean of its divisors is an integer number (15055115150101).
Almost surely, 230110230300201 is an apocalyptic number.
It is an amenable number.
30110230300201 is a deficient number, since it is larger than the sum of its proper divisors (1).
30110230300201 is an equidigital number, since it uses as much as digits as its factorization.
30110230300201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 30110230300201 its reverse (10200303201103), we get a palindrome (40310533501304).
The spelling of 30110230300201 in words is "thirty trillion, one hundred ten billion, two hundred thirty million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •