Base | Representation |
---|---|
bin | 1100010101111100111… |
… | …01001000000110111001 |
3 | 1111112200101220222112021 |
4 | 12022332131020012321 |
5 | 23422030114221213 |
6 | 522455123514441 |
7 | 42432434245213 |
oct | 6127635100671 |
9 | 1445611828467 |
10 | 424102101433 |
11 | 15395164199a |
12 | 6a23ab28a21 |
13 | 30cb9b3581a |
14 | 167531b95b3 |
15 | b072856d8d |
hex | 62be7481b9 |
424102101433 has 8 divisors (see below), whose sum is σ = 425408855040. Its totient is φ = 422795634240.
The previous prime is 424102101431. The next prime is 424102101443. The reversal of 424102101433 is 334101201424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 424102101433 - 21 = 424102101431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 424102101398 and 424102101407.
It is not an unprimeable number, because it can be changed into a prime (424102101431) 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, 3111528 + ... + 3244966.
It is an arithmetic number, because the mean of its divisors is an integer number (53176106880).
Almost surely, 2424102101433 is an apocalyptic number.
It is an amenable number.
424102101433 is a deficient number, since it is larger than the sum of its proper divisors (1306753607).
424102101433 is a wasteful number, since it uses less digits than its factorization.
424102101433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143207.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 424102101433 its reverse (334101201424), we get a palindrome (758203302857).
Subtracting from 424102101433 its reverse (334101201424), we obtain a palindrome (90000900009).
The spelling of 424102101433 in words is "four hundred twenty-four billion, one hundred two million, one hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •