Base | Representation |
---|---|
bin | 110001011000111100001101… |
… | …1110110000110001000100110 |
3 | 2002222012201022022110201022010 |
4 | 1202301320123312012020212 |
5 | 423420301231220444014 |
6 | 4135545155311015050 |
7 | 160335665132061150 |
oct | 14261703366061046 |
9 | 2088181268421263 |
10 | 434436409156134 |
11 | 1164744a02645a0 |
12 | 4088482a50a486 |
13 | 15854240250918 |
14 | 793cb97819ad0 |
15 | 3535a4bdde359 |
hex | 18b1e1bd86226 |
434436409156134 has 128 divisors (see below), whose sum is σ = 1119298830925824. Its totient is φ = 109094684688000.
The previous prime is 434436409156117. The next prime is 434436409156207. The reversal of 434436409156134 is 431651904634434.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 55264 + ... + 29476700.
It is an arithmetic number, because the mean of its divisors is an integer number (8744522116608).
Almost surely, 2434436409156134 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 434436409156134, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (559649415462912).
434436409156134 is an abundant number, since it is smaller than the sum of its proper divisors (684862421769690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
434436409156134 is a wasteful number, since it uses less digits than its factorization.
434436409156134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29422522.
The product of its (nonzero) digits is 44789760, while the sum is 57.
The spelling of 434436409156134 in words is "four hundred thirty-four trillion, four hundred thirty-six billion, four hundred nine million, one hundred fifty-six thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •