Base | Representation |
---|---|
bin | 11001110111101… |
… | …011001100011011 |
3 | 1010020200202201000 |
4 | 121313223030123 |
5 | 1342102301433 |
6 | 111022400043 |
7 | 13520103501 |
oct | 3167531433 |
9 | 1106622630 |
10 | 434025243 |
11 | 202aa5653 |
12 | 101430023 |
13 | 6bbc5792 |
14 | 41900671 |
15 | 28185113 |
hex | 19deb31b |
434025243 has 8 divisors (see below), whose sum is σ = 643000400. Its totient is φ = 289350144.
The previous prime is 434025233. The next prime is 434025257. The reversal of 434025243 is 342520434.
It is not a de Polignac number, because 434025243 - 217 = 433894171 is a prime.
It is a super-2 number, since 2×4340252432 = 376755823122418098, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 16075009 = 434025243 / (4 + 3 + 4 + 0 + 2 + 5 + 2 + 4 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (434025233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8037478 + ... + 8037531.
It is an arithmetic number, because the mean of its divisors is an integer number (80375050).
Almost surely, 2434025243 is an apocalyptic number.
434025243 is a deficient number, since it is larger than the sum of its proper divisors (208975157).
434025243 is a wasteful number, since it uses less digits than its factorization.
434025243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16075018 (or 16075012 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 27.
The square root of 434025243 is about 20833.2724985778. The cubic root of 434025243 is about 757.1321064248.
Adding to 434025243 its reverse (342520434), we get a palindrome (776545677).
The spelling of 434025243 in words is "four hundred thirty-four million, twenty-five thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •