Base | Representation |
---|---|
bin | 1100101000101001100… |
… | …01011011110100110001 |
3 | 1112111120222101020101121 |
4 | 12110110301123310301 |
5 | 24103104342401431 |
6 | 531235151102241 |
7 | 43236253546336 |
oct | 6242461336461 |
9 | 1474528336347 |
10 | 434140200241 |
11 | 158132909120 |
12 | 70180811981 |
13 | 31c296a2367 |
14 | 1702641898d |
15 | b45dc3d611 |
hex | 6514c5bd31 |
434140200241 has 8 divisors (see below), whose sum is σ = 474844068864. Its totient is φ = 393642427920.
The previous prime is 434140200223. The next prime is 434140200251. The reversal of 434140200241 is 142002041434.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 434140200241 - 25 = 434140200209 is a prime.
It is a super-5 number, since 5×4341402002415 (a number of 59 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (434140200251) 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 in 7 ways as a sum of consecutive naturals, for example, 51519666 + ... + 51528091.
It is an arithmetic number, because the mean of its divisors is an integer number (59355508608).
Almost surely, 2434140200241 is an apocalyptic number.
It is an amenable number.
434140200241 is a deficient number, since it is larger than the sum of its proper divisors (40703868623).
434140200241 is a wasteful number, since it uses less digits than its factorization.
434140200241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103048151.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 434140200241 its reverse (142002041434), we get a palindrome (576142241675).
The spelling of 434140200241 in words is "four hundred thirty-four billion, one hundred forty million, two hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •