Base | Representation |
---|---|
bin | 10011001111011101001011… |
… | …00110000100100000000001 |
3 | 12112211000221221122012110222 |
4 | 21213232211212010200001 |
5 | 21021222000232202231 |
6 | 225554032235232425 |
7 | 11624656135503203 |
oct | 1147564546044001 |
9 | 175730857565428 |
10 | 42312501053441 |
11 | 125336a383a683 |
12 | 48b4542ba8715 |
13 | 1a7c089855978 |
14 | a63d16476773 |
15 | 4d59a2aee27b |
hex | 267ba5984801 |
42312501053441 has 8 divisors (see below), whose sum is σ = 42349487753664. Its totient is φ = 42275527957360.
The previous prime is 42312501053429. The next prime is 42312501053447. The reversal of 42312501053441 is 14435010521324.
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 42312501053441 - 214 = 42312501037057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (42312501053447) 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, 2827196 + ... + 9623826.
It is an arithmetic number, because the mean of its divisors is an integer number (5293685969208).
Almost surely, 242312501053441 is an apocalyptic number.
It is an amenable number.
42312501053441 is a deficient number, since it is larger than the sum of its proper divisors (36986700223).
42312501053441 is a wasteful number, since it uses less digits than its factorization.
42312501053441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6802071.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 42312501053441 its reverse (14435010521324), we get a palindrome (56747511574765).
The spelling of 42312501053441 in words is "forty-two trillion, three hundred twelve billion, five hundred one million, fifty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •