Base | Representation |
---|---|
bin | 110000010101111111000110… |
… | …1100111100101110011101101 |
3 | 2001202121222210202011221102122 |
4 | 1200223332031213211303231 |
5 | 421214014121434303010 |
6 | 4104221521313402325 |
7 | 155366104651510211 |
oct | 14053761547456355 |
9 | 2052558722157378 |
10 | 425234203041005 |
11 | 1135468a3869326 |
12 | 3b8392a22693a5 |
13 | 1533754acabbc7 |
14 | 7701633a62941 |
15 | 34264b6764855 |
hex | 182bf8d9e5ced |
425234203041005 has 32 divisors (see below), whose sum is σ = 521733371927040. Its totient is φ = 332569060096000.
The previous prime is 425234203040993. The next prime is 425234203041013. The reversal of 425234203041005 is 500140302432524.
It is a happy number.
It is not a de Polignac number, because 425234203041005 - 28 = 425234203040749 is a prime.
It is a super-2 number, since 2×4252342030410052 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3848183255 + ... + 3848293755.
It is an arithmetic number, because the mean of its divisors is an integer number (16304167872720).
Almost surely, 2425234203041005 is an apocalyptic number.
It is an amenable number.
425234203041005 is a deficient number, since it is larger than the sum of its proper divisors (96499168886035).
425234203041005 is a wasteful number, since it uses less digits than its factorization.
425234203041005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129109.
The product of its (nonzero) digits is 115200, while the sum is 35.
Adding to 425234203041005 its reverse (500140302432524), we get a palindrome (925374505473529).
The spelling of 425234203041005 in words is "four hundred twenty-five trillion, two hundred thirty-four billion, two hundred three million, forty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.231 sec. • engine limits •