Base | Representation |
---|---|
bin | 1100010111111001000… |
… | …00000010001101011111 |
3 | 1111122100221122201000202 |
4 | 12023330200002031133 |
5 | 23431143110113403 |
6 | 523150311014115 |
7 | 42500304211001 |
oct | 6137440021537 |
9 | 1448327581022 |
10 | 425143051103 |
11 | 154336194881 |
12 | 6a48b66a33b |
13 | 311246ac884 |
14 | 16811546371 |
15 | b0d3e26688 |
hex | 62fc80235f |
425143051103 has 4 divisors (see below), whose sum is σ = 425463431520. Its totient is φ = 424822670688.
The previous prime is 425143051097. The next prime is 425143051117. The reversal of 425143051103 is 301150341524.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425143051103 is a prime.
It is a super-2 number, since 2×4251430511032 (a number of 24 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 (425143051153) 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, 160188218 + ... + 160190871.
It is an arithmetic number, because the mean of its divisors is an integer number (106365857880).
Almost surely, 2425143051103 is an apocalyptic number.
425143051103 is a deficient number, since it is larger than the sum of its proper divisors (320380417).
425143051103 is a wasteful number, since it uses less digits than its factorization.
425143051103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320380416.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 425143051103 its reverse (301150341524), we get a palindrome (726293392627).
The spelling of 425143051103 in words is "four hundred twenty-five billion, one hundred forty-three million, fifty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •