Base | Representation |
---|---|
bin | 10011001111011010100101… |
… | …10111001001010000010011 |
3 | 12112210220101012210211011010 |
4 | 21213231102313021100103 |
5 | 21021211124413123220 |
6 | 225553242413022003 |
7 | 11624606552431560 |
oct | 1147552267112023 |
9 | 175726335724133 |
10 | 42311113020435 |
11 | 12533051284966 |
12 | 48b4216184903 |
13 | 1a7bbc810716c |
14 | a63c23d9b867 |
15 | 4d5920d201e0 |
hex | 267b52dc9413 |
42311113020435 has 64 divisors (see below), whose sum is σ = 77423751429120. Its totient is φ = 19328511444480.
The previous prime is 42311113020427. The next prime is 42311113020437. The reversal of 42311113020435 is 53402031111324.
42311113020435 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42311113020435 - 23 = 42311113020427 is a prime.
It is not an unprimeable number, because it can be changed into a prime (42311113020437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2487271080 + ... + 2487288090.
It is an arithmetic number, because the mean of its divisors is an integer number (1209746116080).
Almost surely, 242311113020435 is an apocalyptic number.
42311113020435 is a deficient number, since it is larger than the sum of its proper divisors (35112638408685).
42311113020435 is a wasteful number, since it uses less digits than its factorization.
42311113020435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32428.
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 42311113020435 its reverse (53402031111324), we get a palindrome (95713144131759).
The spelling of 42311113020435 in words is "forty-two trillion, three hundred eleven billion, one hundred thirteen million, twenty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •