Base | Representation |
---|---|
bin | 1110000111000110001… |
… | …0010110111111000111 |
3 | 212011201212122102112211 |
4 | 3201301202112333013 |
5 | 12432440242013111 |
6 | 303211222124251 |
7 | 23341316336521 |
oct | 3416142267707 |
9 | 764655572484 |
10 | 242423001031 |
11 | 938a1511832 |
12 | 3ab96b80687 |
13 | 19b25381753 |
14 | ba3a3b8a11 |
15 | 648ca27521 |
hex | 3871896fc7 |
242423001031 has 4 divisors (see below), whose sum is σ = 242657680672. Its totient is φ = 242188321392.
The previous prime is 242423001019. The next prime is 242423001077. The reversal of 242423001031 is 130100324242.
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 242423001031 - 25 = 242423000999 is a prime.
It is a super-2 number, since 2×2424230010312 (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 = 242423000993 and 242423001011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242423001091) 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, 117338271 + ... + 117340336.
It is an arithmetic number, because the mean of its divisors is an integer number (60664420168).
Almost surely, 2242423001031 is an apocalyptic number.
242423001031 is a deficient number, since it is larger than the sum of its proper divisors (234679641).
242423001031 is a wasteful number, since it uses less digits than its factorization.
242423001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234679640.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 242423001031 its reverse (130100324242), we get a palindrome (372523325273).
The spelling of 242423001031 in words is "two hundred forty-two billion, four hundred twenty-three million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •