Base | Representation |
---|---|
bin | 10011010000000000001100… |
… | …01111100110111010001001 |
3 | 12112212211111020201210112011 |
4 | 21220000012033212322021 |
5 | 21022024001410033301 |
6 | 230010422030015521 |
7 | 11626223064511210 |
oct | 1150000617467211 |
9 | 175784436653464 |
10 | 42331302424201 |
11 | 1254067170981a |
12 | 48b810b6475a1 |
13 | 1a80a94ac901b |
14 | a64bbb4a8077 |
15 | 4d6203500a51 |
hex | 2680063e6e89 |
42331302424201 has 8 divisors (see below), whose sum is σ = 48726679050560. Its totient is φ = 36022937725008.
The previous prime is 42331302424183. The next prime is 42331302424211. The reversal of 42331302424201 is 10242420313324.
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 42331302424201 - 29 = 42331302423689 is a prime.
It is not an unprimeable number, because it can be changed into a prime (42331302424211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21752980746 + ... + 21752982691.
It is an arithmetic number, because the mean of its divisors is an integer number (6090834881320).
Almost surely, 242331302424201 is an apocalyptic number.
It is an amenable number.
42331302424201 is a deficient number, since it is larger than the sum of its proper divisors (6395376626359).
42331302424201 is a wasteful number, since it uses less digits than its factorization.
42331302424201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43505963583.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 42331302424201 its reverse (10242420313324), we get a palindrome (52573722737525).
The spelling of 42331302424201 in words is "forty-two trillion, three hundred thirty-one billion, three hundred two million, four hundred twenty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •