Base | Representation |
---|---|
bin | 1100101001000100011… |
… | …00010100001010011111 |
3 | 1112112011200001001120021 |
4 | 12110202030110022133 |
5 | 24104040012204214 |
6 | 531313352533011 |
7 | 43244656363300 |
oct | 6244214241237 |
9 | 1475150031507 |
10 | 434365350559 |
11 | 158238a09968 |
12 | 702240b1167 |
13 | 31c642240ba |
14 | 170482a67a7 |
15 | b4738b4924 |
hex | 652231429f |
434365350559 has 12 divisors (see below), whose sum is σ = 505710052488. Its totient is φ = 371997855600.
The previous prime is 434365350557. The next prime is 434365350589. The reversal of 434365350559 is 955053563434.
It is not a de Polignac number, because 434365350559 - 21 = 434365350557 is a prime.
It is a super-2 number, since 2×4343653505592 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434365350557) 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, 3695137 + ... + 3810874.
It is an arithmetic number, because the mean of its divisors is an integer number (42142504374).
Almost surely, 2434365350559 is an apocalyptic number.
434365350559 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
434365350559 is a deficient number, since it is larger than the sum of its proper divisors (71344701929).
434365350559 is a wasteful number, since it uses less digits than its factorization.
434365350559 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7507206 (or 7507199 counting only the distinct ones).
The product of its (nonzero) digits is 14580000, while the sum is 52.
The spelling of 434365350559 in words is "four hundred thirty-four billion, three hundred sixty-five million, three hundred fifty thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.670 sec. • engine limits •