Base | Representation |
---|---|
bin | 1100011000011011001… |
… | …11101010110011000111 |
3 | 1111200002222002200110122 |
4 | 12030031213222303013 |
5 | 23432240121440111 |
6 | 523235011012155 |
7 | 42510362405252 |
oct | 6141547526307 |
9 | 1450088080418 |
10 | 425430265031 |
11 | 154473325962 |
12 | 6a54b89a05b |
13 | 3116c051945 |
14 | 1683b74c099 |
15 | b0ee25bcdb |
hex | 630d9eacc7 |
425430265031 has 4 divisors (see below), whose sum is σ = 440100274200. Its totient is φ = 410760255864.
The previous prime is 425430265021. The next prime is 425430265033. The reversal of 425430265031 is 130562034524.
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 425430265031 - 26 = 425430264967 is a prime.
It is a super-2 number, since 2×4254302650312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 425430264982 and 425430265000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425430265033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7335004541 + ... + 7335004598.
It is an arithmetic number, because the mean of its divisors is an integer number (110025068550).
Almost surely, 2425430265031 is an apocalyptic number.
425430265031 is a deficient number, since it is larger than the sum of its proper divisors (14670009169).
425430265031 is a wasteful number, since it uses less digits than its factorization.
425430265031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14670009168.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 425430265031 its reverse (130562034524), we get a palindrome (555992299555).
The spelling of 425430265031 in words is "four hundred twenty-five billion, four hundred thirty million, two hundred sixty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •