Base | Representation |
---|---|
bin | 1011011111110100100… |
… | …10010101101101101101 |
3 | 1101202200002120221200112 |
4 | 11233322102111231231 |
5 | 22433021012313334 |
6 | 501251314305405 |
7 | 40353326151011 |
oct | 5577222255555 |
9 | 1352602527615 |
10 | 395041135469 |
11 | 142599471052 |
12 | 6468a588265 |
13 | 2b338183086 |
14 | 1519776c541 |
15 | a4213ba4ce |
hex | 5bfa495b6d |
395041135469 has 4 divisors (see below), whose sum is σ = 395046771900. Its totient is φ = 395035499040.
The previous prime is 395041135459. The next prime is 395041135513. The reversal of 395041135469 is 964531140593.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 391202713444 + 3838422025 = 625462^2 + 61955^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-395041135469 is a prime.
It is a super-2 number, since 2×3950411354692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 8.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (395041135409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2711744 + ... + 2853705.
It is an arithmetic number, because the mean of its divisors is an integer number (98761692975).
Almost surely, 2395041135469 is an apocalyptic number.
It is an amenable number.
395041135469 is a deficient number, since it is larger than the sum of its proper divisors (5636431).
395041135469 is an equidigital number, since it uses as much as digits as its factorization.
395041135469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5636430.
The product of its (nonzero) digits is 1749600, while the sum is 50.
The spelling of 395041135469 in words is "three hundred ninety-five billion, forty-one million, one hundred thirty-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •