Base | Representation |
---|---|
bin | 1101101110111110100100… |
… | …01010100011111111100001 |
3 | 10221221020012100112222112022 |
4 | 12313133102022203333201 |
5 | 12424310022401324101 |
6 | 144122203411511225 |
7 | 6234660602115056 |
oct | 667372212437741 |
9 | 127836170488468 |
10 | 30201441042401 |
11 | 96943a5133792 |
12 | 34792a95b8515 |
13 | 13b0ca317a025 |
14 | 765a869c502d |
15 | 37591e9eda1b |
hex | 1b77d22a3fe1 |
30201441042401 has 2 divisors, whose sum is σ = 30201441042402. Its totient is φ = 30201441042400.
The previous prime is 30201441042391. The next prime is 30201441042403. The reversal of 30201441042401 is 10424014410203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28237586349025 + 1963854693376 = 5313905^2 + 1401376^2 .
It is a cyclic number.
It is not a de Polignac number, because 30201441042401 - 242 = 25803394531297 is a prime.
It is a Sophie Germain prime.
Together with 30201441042403, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (30201441042403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15100720521200 + 15100720521201.
It is an arithmetic number, because the mean of its divisors is an integer number (15100720521201).
Almost surely, 230201441042401 is an apocalyptic number.
It is an amenable number.
30201441042401 is a deficient number, since it is larger than the sum of its proper divisors (1).
30201441042401 is an equidigital number, since it uses as much as digits as its factorization.
30201441042401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 30201441042401 its reverse (10424014410203), we get a palindrome (40625455452604).
The spelling of 30201441042401 in words is "thirty trillion, two hundred one billion, four hundred forty-one million, forty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •