Base | Representation |
---|---|
bin | 1101101100101100011101… |
… | …10010000011111110101101 |
3 | 10221122201201202000211021111 |
4 | 12312112032302003332231 |
5 | 12422013401242310041 |
6 | 144022152104232021 |
7 | 6226213022652334 |
oct | 666261662037655 |
9 | 127581652024244 |
10 | 30123001135021 |
11 | 9664102921353 |
12 | 346605816b611 |
13 | 13a6782317652 |
14 | 761d65112d1b |
15 | 37387d499981 |
hex | 1b658ec83fad |
30123001135021 has 2 divisors, whose sum is σ = 30123001135022. Its totient is φ = 30123001135020.
The previous prime is 30123001134931. The next prime is 30123001135027. The reversal of 30123001135021 is 12053110032103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29844248814121 + 278752320900 = 5462989^2 + 527970^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30123001135021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30123001134983 and 30123001135001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30123001135027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15061500567510 + 15061500567511.
It is an arithmetic number, because the mean of its divisors is an integer number (15061500567511).
Almost surely, 230123001135021 is an apocalyptic number.
It is an amenable number.
30123001135021 is a deficient number, since it is larger than the sum of its proper divisors (1).
30123001135021 is an equidigital number, since it uses as much as digits as its factorization.
30123001135021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 30123001135021 its reverse (12053110032103), we get a palindrome (42176111167124).
The spelling of 30123001135021 in words is "thirty trillion, one hundred twenty-three billion, one million, one hundred thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •