Base | Representation |
---|---|
bin | 11001010101110… |
… | …010100001100101 |
3 | 1002121222110200211 |
4 | 121111302201211 |
5 | 1332314023443 |
6 | 110104135421 |
7 | 13351436065 |
oct | 3125624145 |
9 | 1077873624 |
10 | 425142373 |
11 | 1a8a88837 |
12 | ba467571 |
13 | 6a105546 |
14 | 4066b3a5 |
15 | 274cd19d |
hex | 19572865 |
425142373 has 8 divisors (see below), whose sum is σ = 446868288. Its totient is φ = 403686624.
The previous prime is 425142359. The next prime is 425142397. The reversal of 425142373 is 373241524.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425142373 is a prime.
It is a super-2 number, since 2×4251423732 = 361492074640142258, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425142313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64311 + ... + 70612.
It is an arithmetic number, because the mean of its divisors is an integer number (55858536).
Almost surely, 2425142373 is an apocalyptic number.
It is an amenable number.
425142373 is a deficient number, since it is larger than the sum of its proper divisors (21725915).
425142373 is a wasteful number, since it uses less digits than its factorization.
425142373 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135083.
The product of its digits is 20160, while the sum is 31.
The square root of 425142373 is about 20618.9808914020. The cubic root of 425142373 is about 751.9312438316.
Adding to 425142373 its reverse (373241524), we get a palindrome (798383897).
It can be divided in two parts, 42 and 5142373, that added together give a palindrome (5142415).
The spelling of 425142373 in words is "four hundred twenty-five million, one hundred forty-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •