Base | Representation |
---|---|
bin | 1100010110001100011… |
… | …01000110111011011111 |
3 | 1111120000110120121111220 |
4 | 12023012031012323133 |
5 | 23422311410320111 |
6 | 522520050344423 |
7 | 42435603344166 |
oct | 6130615067337 |
9 | 1446013517456 |
10 | 424232120031 |
11 | 153a08a76885 |
12 | 6a27658b113 |
13 | 3100aa598c5 |
14 | 167665823dd |
15 | b07de8ae06 |
hex | 62c6346edf |
424232120031 has 4 divisors (see below), whose sum is σ = 565642826712. Its totient is φ = 282821413352.
The previous prime is 424232120027. The next prime is 424232120057. The reversal of 424232120031 is 130021232424.
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 424232120031 - 22 = 424232120027 is a prime.
It is a super-2 number, since 2×4242321200312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 424232119983 and 424232120010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424232120021) 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, 70705353336 + ... + 70705353341.
It is an arithmetic number, because the mean of its divisors is an integer number (141410706678).
Almost surely, 2424232120031 is an apocalyptic number.
424232120031 is a deficient number, since it is larger than the sum of its proper divisors (141410706681).
424232120031 is a wasteful number, since it uses less digits than its factorization.
424232120031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141410706680.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 424232120031 its reverse (130021232424), we get a palindrome (554253352455).
The spelling of 424232120031 in words is "four hundred twenty-four billion, two hundred thirty-two million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •