Base | Representation |
---|---|
bin | 1111100100101011001101… |
… | …11001101010001100100001 |
3 | 11111020211121211011020210122 |
4 | 13302111212321222030201 |
5 | 13442034241131021311 |
6 | 200500055452010025 |
7 | 10133104300414451 |
oct | 762254671521441 |
9 | 144224554136718 |
10 | 34245500642081 |
11 | aa03487374753 |
12 | 3a11010a60915 |
13 | 161544c0b63b1 |
14 | 8656c371bd61 |
15 | 3e5c0da8a0db |
hex | 1f2566e6a321 |
34245500642081 has 2 divisors, whose sum is σ = 34245500642082. Its totient is φ = 34245500642080.
The previous prime is 34245500642033. The next prime is 34245500642137. The reversal of 34245500642081 is 18024600554243.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22170160590400 + 12075340051681 = 4708520^2 + 3474959^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34245500642081 is a prime.
It is a super-2 number, since 2×342455006420812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (34245500642011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17122750321040 + 17122750321041.
It is an arithmetic number, because the mean of its divisors is an integer number (17122750321041).
Almost surely, 234245500642081 is an apocalyptic number.
It is an amenable number.
34245500642081 is a deficient number, since it is larger than the sum of its proper divisors (1).
34245500642081 is an equidigital number, since it uses as much as digits as its factorization.
34245500642081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 921600, while the sum is 44.
The spelling of 34245500642081 in words is "thirty-four trillion, two hundred forty-five billion, five hundred million, six hundred forty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •