Base | Representation |
---|---|
bin | 1000111000111010101… |
… | …10001001001011100101 |
3 | 1002012101021212202101012 |
4 | 10130131112021023211 |
5 | 20001012331201203 |
6 | 352152004312005 |
7 | 31031651564600 |
oct | 4343526111345 |
9 | 1065337782335 |
10 | 305435022053 |
11 | 10859711a867 |
12 | 4b2416a2605 |
13 | 22a57b418a5 |
14 | 10ad6cc3337 |
15 | 7e298e5bd8 |
hex | 471d5892e5 |
305435022053 has 6 divisors (see below), whose sum is σ = 355301964486. Its totient is φ = 261801447432.
The previous prime is 305435022047. The next prime is 305435022143. The reversal of 305435022053 is 350220534503.
It can be written as a sum of positive squares in only one way, i.e., 275081368324 + 30353653729 = 524482^2 + 174223^2 .
It is not a de Polignac number, because 305435022053 - 220 = 305433973477 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305435022953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3116683850 + ... + 3116683947.
It is an arithmetic number, because the mean of its divisors is an integer number (59216994081).
Almost surely, 2305435022053 is an apocalyptic number.
It is an amenable number.
305435022053 is a deficient number, since it is larger than the sum of its proper divisors (49866942433).
305435022053 is an equidigital number, since it uses as much as digits as its factorization.
305435022053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6233367811 (or 6233367804 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 32.
Adding to 305435022053 its reverse (350220534503), we get a palindrome (655655556556).
The spelling of 305435022053 in words is "three hundred five billion, four hundred thirty-five million, twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •