Base | Representation |
---|---|
bin | 10100110110001… |
… | …100111000100101 |
3 | 220101010021201222 |
4 | 110312030320211 |
5 | 1204014042434 |
6 | 54412230125 |
7 | 11444564444 |
oct | 2466147045 |
9 | 811107658 |
10 | 349752869 |
11 | 16a476564 |
12 | 9916b345 |
13 | 575ca87b |
14 | 34644d5b |
15 | 20a8a72e |
hex | 14d8ce25 |
349752869 has 2 divisors, whose sum is σ = 349752870. Its totient is φ = 349752868.
The previous prime is 349752857. The next prime is 349752929. The reversal of 349752869 is 968257943.
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., 339112225 + 10640644 = 18415^2 + 3262^2 .
It is an emirp because it is prime and its reverse (968257943) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 349752869 - 24 = 349752853 is a prime.
It is a super-2 number, since 2×3497528692 = 244654138747462322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 349752869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (349752269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 174876434 + 174876435.
It is an arithmetic number, because the mean of its divisors is an integer number (174876435).
Almost surely, 2349752869 is an apocalyptic number.
It is an amenable number.
349752869 is a deficient number, since it is larger than the sum of its proper divisors (1).
349752869 is an equidigital number, since it uses as much as digits as its factorization.
349752869 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3265920, while the sum is 53.
The square root of 349752869 is about 18701.6809137575. The cubic root of 349752869 is about 704.5639669157.
The spelling of 349752869 in words is "three hundred forty-nine million, seven hundred fifty-two thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •