Base | Representation |
---|---|
bin | 11110010101011100000… |
… | …11110110110111010001 |
3 | 10200122100211201120020202 |
4 | 33022232003312313101 |
5 | 114034113344113434 |
6 | 2114454352144545 |
7 | 135206136434054 |
oct | 17125603666721 |
9 | 3618324646222 |
10 | 1042302332369 |
11 | 372046548361 |
12 | 14a008b38155 |
13 | 7739a32ba3c |
14 | 3863a6cca9b |
15 | 1c1a5430a7e |
hex | f2ae0f6dd1 |
1042302332369 has 2 divisors, whose sum is σ = 1042302332370. Its totient is φ = 1042302332368.
The previous prime is 1042302332347. The next prime is 1042302332377. The reversal of 1042302332369 is 9632332032401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1042195974400 + 106357969 = 1020880^2 + 10313^2 .
It is a cyclic number.
It is not a de Polignac number, because 1042302332369 - 212 = 1042302328273 is a prime.
It is a super-2 number, since 2×10423023323692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1042302332339) 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 as a sum of consecutive naturals, namely, 521151166184 + 521151166185.
It is an arithmetic number, because the mean of its divisors is an integer number (521151166185).
Almost surely, 21042302332369 is an apocalyptic number.
It is an amenable number.
1042302332369 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042302332369 is an equidigital number, since it uses as much as digits as its factorization.
1042302332369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 38.
The spelling of 1042302332369 in words is "one trillion, forty-two billion, three hundred two million, three hundred thirty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •