Base | Representation |
---|---|
bin | 100111010010011010101110… |
… | …1011011010001001100011101 |
3 | 1200022121000121212212100120202 |
4 | 1032210311131123101030131 |
5 | 330243431122321022421 |
6 | 3222552434054153245 |
7 | 132535153032063641 |
oct | 11644653533211435 |
9 | 1608530555770522 |
10 | 345578931032861 |
11 | a0126224386809 |
12 | 32913618952825 |
13 | 11aa9c5170c876 |
14 | 614a1766b4c21 |
15 | 29e447b0e810b |
hex | 13a4d5d6d131d |
345578931032861 has 2 divisors, whose sum is σ = 345578931032862. Its totient is φ = 345578931032860.
The previous prime is 345578931032821. The next prime is 345578931032899. The reversal of 345578931032861 is 168230139875543.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 287444253380761 + 58134677652100 = 16954181^2 + 7624610^2 .
It is a cyclic number.
It is not a de Polignac number, because 345578931032861 - 214 = 345578931016477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (345578931032821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 172789465516430 + 172789465516431.
It is an arithmetic number, because the mean of its divisors is an integer number (172789465516431).
It is a 1-persistent number, because it is pandigital, but 2⋅345578931032861 = 691157862065722 is not.
Almost surely, 2345578931032861 is an apocalyptic number.
It is an amenable number.
345578931032861 is a deficient number, since it is larger than the sum of its proper divisors (1).
345578931032861 is an equidigital number, since it uses as much as digits as its factorization.
345578931032861 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 130636800, while the sum is 65.
The spelling of 345578931032861 in words is "three hundred forty-five trillion, five hundred seventy-eight billion, nine hundred thirty-one million, thirty-two thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •