Base | Representation |
---|---|
bin | 10011001111011011001000… |
… | …00111100010110010100011 |
3 | 12112210221010101120112100210 |
4 | 21213231210013202302203 |
5 | 21021212223022011003 |
6 | 225553331234145203 |
7 | 11624616666305613 |
oct | 1147554407426243 |
9 | 175727111515323 |
10 | 42311402532003 |
11 | 1253318a745220 |
12 | 48b4297122203 |
13 | 1a7bc430a1c97 |
14 | a63c50600a43 |
15 | 4d593b45b503 |
hex | 267b641e2ca3 |
42311402532003 has 16 divisors (see below), whose sum is σ = 64783008662400. Its totient is φ = 24293628247680.
The previous prime is 42311402532001. The next prime is 42311402532011. The reversal of 42311402532003 is 30023520411324.
42311402532003 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 42311402532003 - 21 = 42311402532001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (42311402532001) 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 15 ways as a sum of consecutive naturals, for example, 33741149718 + ... + 33741150971.
It is an arithmetic number, because the mean of its divisors is an integer number (4048938041400).
Almost surely, 242311402532003 is an apocalyptic number.
42311402532003 is a deficient number, since it is larger than the sum of its proper divisors (22471606130397).
42311402532003 is a wasteful number, since it uses less digits than its factorization.
42311402532003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67482300722.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 42311402532003 its reverse (30023520411324), we get a palindrome (72334922943327).
The spelling of 42311402532003 in words is "forty-two trillion, three hundred eleven billion, four hundred two million, five hundred thirty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •