Base | Representation |
---|---|
bin | 100000010000110001101… |
… | …0111100001011100011101 |
3 | 120200220010012022002222002 |
4 | 1000201203113201130131 |
5 | 1040121440240011112 |
6 | 13232552444332045 |
7 | 635231320456430 |
oct | 100414327413435 |
9 | 16626105262862 |
10 | 4434073360157 |
11 | 145a5308a7851 |
12 | 5b742a244025 |
13 | 26219269763c |
14 | 114878919817 |
15 | 7a518de41c2 |
hex | 408635e171d |
4434073360157 has 8 divisors (see below), whose sum is σ = 5138885826432. Its totient is φ = 3747104247600.
The previous prime is 4434073360133. The next prime is 4434073360159. The reversal of 4434073360157 is 7510633704344.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4434073360157 - 228 = 4433804924701 is a prime.
It is a super-2 number, since 2×44340733601572 (a number of 26 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 (4434073360159) 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, 4460837894 + ... + 4460838887.
It is an arithmetic number, because the mean of its divisors is an integer number (642360728304).
Almost surely, 24434073360157 is an apocalyptic number.
It is an amenable number.
4434073360157 is a deficient number, since it is larger than the sum of its proper divisors (704812466275).
4434073360157 is an equidigital number, since it uses as much as digits as its factorization.
4434073360157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8921676859.
The product of its (nonzero) digits is 2540160, while the sum is 47.
The spelling of 4434073360157 in words is "four trillion, four hundred thirty-four billion, seventy-three million, three hundred sixty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •