Base | Representation |
---|---|
bin | 10100100110111… |
… | …011101101111101 |
3 | 220002120221101021 |
4 | 110212323231331 |
5 | 1202003003042 |
6 | 54150344141 |
7 | 11365554436 |
oct | 2446735575 |
9 | 802527337 |
10 | 345750397 |
11 | 168192433 |
12 | 9795b051 |
13 | 56828b45 |
14 | 33cc248d |
15 | 20549867 |
hex | 149bbb7d |
345750397 has 2 divisors, whose sum is σ = 345750398. Its totient is φ = 345750396.
The previous prime is 345750341. The next prime is 345750469. The reversal of 345750397 is 793057543.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 190274436 + 155475961 = 13794^2 + 12469^2 .
It is an emirp because it is prime and its reverse (793057543) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 345750397 - 27 = 345750269 is a prime.
It is equal to p18587455 and since 345750397 and 18587455 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (345750337) 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 as a sum of consecutive naturals, namely, 172875198 + 172875199.
It is an arithmetic number, because the mean of its divisors is an integer number (172875199).
Almost surely, 2345750397 is an apocalyptic number.
It is an amenable number.
345750397 is a deficient number, since it is larger than the sum of its proper divisors (1).
345750397 is an equidigital number, since it uses as much as digits as its factorization.
345750397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 396900, while the sum is 43.
The square root of 345750397 is about 18594.3646570675. The cubic root of 345750397 is about 701.8660395136.
The spelling of 345750397 in words is "three hundred forty-five million, seven hundred fifty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •