Base | Representation |
---|---|
bin | 10011001010100101011001… |
… | …11010001001011001001001 |
3 | 12112020000220212201022222202 |
4 | 21211102230322021121021 |
5 | 21011001201212013304 |
6 | 225345111215125545 |
7 | 11606612235343046 |
oct | 1145225472113111 |
9 | 175200825638882 |
10 | 42145120032329 |
11 | 124797105a0076 |
12 | 488800b5138b5 |
13 | 1a69363388242 |
14 | a59b985821cd |
15 | 4d145818281e |
hex | 2654ace89649 |
42145120032329 has 2 divisors, whose sum is σ = 42145120032330. Its totient is φ = 42145120032328.
The previous prime is 42145120032283. The next prime is 42145120032341. The reversal of 42145120032329 is 92323002154124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41694915265600 + 450204766729 = 6457160^2 + 670973^2 .
It is a cyclic number.
It is not a de Polignac number, because 42145120032329 - 228 = 42144851596873 is a prime.
It is a super-2 number, since 2×421451200323292 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42145120032292 and 42145120032301.
It is not a weakly prime, because it can be changed into another prime (42145120032529) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21072560016164 + 21072560016165.
It is an arithmetic number, because the mean of its divisors is an integer number (21072560016165).
Almost surely, 242145120032329 is an apocalyptic number.
It is an amenable number.
42145120032329 is a deficient number, since it is larger than the sum of its proper divisors (1).
42145120032329 is an equidigital number, since it uses as much as digits as its factorization.
42145120032329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 42145120032329 in words is "forty-two trillion, one hundred forty-five billion, one hundred twenty million, thirty-two thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •