Base | Representation |
---|---|
bin | 100010101101011100100000… |
… | …1000011000011010101110101 |
3 | 1111001000122120102200020021222 |
4 | 1011122321001003003111311 |
5 | 310004222300422210423 |
6 | 3001202530231120125 |
7 | 121211101066660412 |
oct | 10532710103032565 |
9 | 1431018512606258 |
10 | 305313136522613 |
11 | 8931163508513a |
12 | 2a2ab893813045 |
13 | 10148b9ca59c8b |
14 | 555733dc67109 |
15 | 2546d66b5c3c8 |
hex | 115ae410c3575 |
305313136522613 has 2 divisors, whose sum is σ = 305313136522614. Its totient is φ = 305313136522612.
The previous prime is 305313136522547. The next prime is 305313136522633. The reversal of 305313136522613 is 316225631313503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 225605416707889 + 79707719814724 = 15020167^2 + 8927918^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-305313136522613 is a prime.
It is a super-2 number, since 2×3053131365226132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (305313136522633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152656568261306 + 152656568261307.
It is an arithmetic number, because the mean of its divisors is an integer number (152656568261307).
Almost surely, 2305313136522613 is an apocalyptic number.
It is an amenable number.
305313136522613 is a deficient number, since it is larger than the sum of its proper divisors (1).
305313136522613 is an equidigital number, since it uses as much as digits as its factorization.
305313136522613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 874800, while the sum is 44.
The spelling of 305313136522613 in words is "three hundred five trillion, three hundred thirteen billion, one hundred thirty-six million, five hundred twenty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •