Base | Representation |
---|---|
bin | 110000001111011010101101… |
… | …0100011101010111001011101 |
3 | 2001122102200112002002101111122 |
4 | 1200132311122203222321131 |
5 | 421104221203212234401 |
6 | 4102251053332500325 |
7 | 155243634513032444 |
oct | 14036653243527135 |
9 | 2048380462071448 |
10 | 424331403243101 |
11 | 113228a34919972 |
12 | 3b71232847a6a5 |
13 | 152a0383466863 |
14 | 76ada6c8a9d5b |
15 | 340cc7853d21b |
hex | 181ed5a8eae5d |
424331403243101 has 8 divisors (see below), whose sum is σ = 424505854500480. Its totient is φ = 424156969710432.
The previous prime is 424331403243047. The next prime is 424331403243127. The reversal of 424331403243101 is 101342304133424.
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 424331403243101 - 242 = 419933356731997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424331403243131) 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, 43565681 + ... + 52408313.
It is an arithmetic number, because the mean of its divisors is an integer number (53063231812560).
Almost surely, 2424331403243101 is an apocalyptic number.
It is an amenable number.
424331403243101 is a deficient number, since it is larger than the sum of its proper divisors (174451257379).
424331403243101 is a wasteful number, since it uses less digits than its factorization.
424331403243101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8862355.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 424331403243101 its reverse (101342304133424), we get a palindrome (525673707376525).
The spelling of 424331403243101 in words is "four hundred twenty-four trillion, three hundred thirty-one billion, four hundred three million, two hundred forty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •