Base | Representation |
---|---|
bin | 1101101111010001000111… |
… | …10001110111010000110001 |
3 | 10221222011220102112100002122 |
4 | 12313220203301313100301 |
5 | 12424440421424442113 |
6 | 144130531535524025 |
7 | 6235462442624144 |
oct | 667504361672061 |
9 | 127864812470078 |
10 | 30211400234033 |
11 | 9698645905877 |
12 | 347b208989615 |
13 | 13b1bcc579a25 |
14 | 76634d56405b |
15 | 375d03eea408 |
hex | 1b7a23c77431 |
30211400234033 has 2 divisors, whose sum is σ = 30211400234034. Its totient is φ = 30211400234032.
The previous prime is 30211400234023. The next prime is 30211400234107. The reversal of 30211400234033 is 33043200411203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29877954041329 + 333446192704 = 5466073^2 + 577448^2 .
It is a cyclic number.
It is not a de Polignac number, because 30211400234033 - 212 = 30211400229937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30211400233993 and 30211400234011.
It is not a weakly prime, because it can be changed into another prime (30211400234023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15105700117016 + 15105700117017.
It is an arithmetic number, because the mean of its divisors is an integer number (15105700117017).
Almost surely, 230211400234033 is an apocalyptic number.
It is an amenable number.
30211400234033 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211400234033 is an equidigital number, since it uses as much as digits as its factorization.
30211400234033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 30211400234033 its reverse (33043200411203), we get a palindrome (63254600645236).
The spelling of 30211400234033 in words is "thirty trillion, two hundred eleven billion, four hundred million, two hundred thirty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •