Base | Representation |
---|---|
bin | 10100100100001… |
… | …111111111010011 |
3 | 220001021012111100 |
4 | 110210033333103 |
5 | 1201313000440 |
6 | 54123315443 |
7 | 11356564626 |
oct | 2444177723 |
9 | 801235440 |
10 | 345046995 |
11 | 167851a07 |
12 | 9767bb83 |
13 | 56640927 |
14 | 33b7bdbd |
15 | 2045b230 |
hex | 1490ffd3 |
345046995 has 12 divisors (see below), whose sum is σ = 598081536. Its totient is φ = 184025040.
The previous prime is 345046991. The next prime is 345047029. The reversal of 345046995 is 599640543.
It is not a de Polignac number, because 345046995 - 22 = 345046991 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45), and also a Moran number because the ratio is a prime number: 7667711 = 345046995 / (3 + 4 + 5 + 0 + 4 + 6 + 9 + 9 + 5).
It is a self number, because there is not a number n which added to its sum of digits gives 345046995.
It is not an unprimeable number, because it can be changed into a prime (345046991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3833811 + ... + 3833900.
It is an arithmetic number, because the mean of its divisors is an integer number (49840128).
Almost surely, 2345046995 is an apocalyptic number.
345046995 is a deficient number, since it is larger than the sum of its proper divisors (253034541).
345046995 is a wasteful number, since it uses less digits than its factorization.
345046995 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7667722 (or 7667719 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 45.
The square root of 345046995 is about 18575.4406408031. The cubic root of 345046995 is about 701.3897526190.
The spelling of 345046995 in words is "three hundred forty-five million, forty-six thousand, nine hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •