Base | Representation |
---|---|
bin | 1111100111001001010110… |
… | …10111010010011011110001 |
3 | 11111112221202200101111112002 |
4 | 13303210223113102123301 |
5 | 13444432130141401113 |
6 | 201003100223543345 |
7 | 10142201225530562 |
oct | 763445327223361 |
9 | 144487680344462 |
10 | 34330401122033 |
11 | aa36494494965 |
12 | 3a25565a5ab55 |
13 | 162045c573893 |
14 | 869859250169 |
15 | 3e802c3a2c58 |
hex | 1f392b5d26f1 |
34330401122033 has 2 divisors, whose sum is σ = 34330401122034. Its totient is φ = 34330401122032.
The previous prime is 34330401121957. The next prime is 34330401122051. The reversal of 34330401122033 is 33022110403343.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22289417841889 + 12040983280144 = 4721167^2 + 3470012^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34330401122033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 34330401121987 and 34330401122005.
It is not a weakly prime, because it can be changed into another prime (34330403122033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17165200561016 + 17165200561017.
It is an arithmetic number, because the mean of its divisors is an integer number (17165200561017).
Almost surely, 234330401122033 is an apocalyptic number.
It is an amenable number.
34330401122033 is a deficient number, since it is larger than the sum of its proper divisors (1).
34330401122033 is an equidigital number, since it uses as much as digits as its factorization.
34330401122033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 34330401122033 its reverse (33022110403343), we get a palindrome (67352511525376).
The spelling of 34330401122033 in words is "thirty-four trillion, three hundred thirty billion, four hundred one million, one hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •