Base | Representation |
---|---|
bin | 100000001100110000100… |
… | …0111000011101101010111 |
3 | 120200001211220120012100002 |
4 | 1000121201013003231113 |
5 | 1040001303030230111 |
6 | 13225004400441515 |
7 | 634504444362554 |
oct | 100314107035527 |
9 | 16601756505302 |
10 | 4425445555031 |
11 | 1456903710096 |
12 | 5b582091929b |
13 | 2614190719c7 |
14 | 11429ab0ba2b |
15 | 7a1b173763b |
hex | 406611c3b57 |
4425445555031 has 4 divisors (see below), whose sum is σ = 4425946349832. Its totient is φ = 4424944760232.
The previous prime is 4425445555019. The next prime is 4425445555057. The reversal of 4425445555031 is 1305555445244.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4425445555031 - 222 = 4425441360727 is a prime.
It is a super-2 number, since 2×44254455550312 (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 (4425445555001) 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 3 ways as a sum of consecutive naturals, for example, 250384145 + ... + 250401818.
It is an arithmetic number, because the mean of its divisors is an integer number (1106486587458).
Almost surely, 24425445555031 is an apocalyptic number.
4425445555031 is a deficient number, since it is larger than the sum of its proper divisors (500794801).
4425445555031 is an equidigital number, since it uses as much as digits as its factorization.
4425445555031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500794800.
The product of its (nonzero) digits is 4800000, while the sum is 47.
The spelling of 4425445555031 in words is "four trillion, four hundred twenty-five billion, four hundred forty-five million, five hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •