Base | Representation |
---|---|
bin | 100010101110001011001011… |
… | …1000100110010001100011101 |
3 | 1111001101020021110110221002110 |
4 | 1011130112113010302030131 |
5 | 310012343032200040203 |
6 | 3001320543523144233 |
7 | 121221246606015066 |
oct | 10534262704621435 |
9 | 1431336243427073 |
10 | 305413364065053 |
11 | 893500979a5242 |
12 | 2a3071a5815079 |
13 | 101554837481ca |
14 | 555c12b1d956d |
15 | 2549780d41d03 |
hex | 115c59713231d |
305413364065053 has 16 divisors (see below), whose sum is σ = 409754432393216. Its totient is φ = 202340836367280.
The previous prime is 305413364064971. The next prime is 305413364065123. The reversal of 305413364065053 is 350560463314503.
It is not a de Polignac number, because 305413364065053 - 216 = 305413363999517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 305413364064993 and 305413364065011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305413364065753) 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 in 15 ways as a sum of consecutive naturals, for example, 23994943 + ... + 34446828.
It is an arithmetic number, because the mean of its divisors is an integer number (25609652024576).
Almost surely, 2305413364065053 is an apocalyptic number.
It is an amenable number.
305413364065053 is a deficient number, since it is larger than the sum of its proper divisors (104341068328163).
305413364065053 is a wasteful number, since it uses less digits than its factorization.
305413364065053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58452624.
The product of its (nonzero) digits is 5832000, while the sum is 48.
The spelling of 305413364065053 in words is "three hundred five trillion, four hundred thirteen billion, three hundred sixty-four million, sixty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •