Base | Representation |
---|---|
bin | 11110000010010101000… |
… | …01010101000111111101 |
3 | 10122122212210212010002211 |
4 | 33001022201111013331 |
5 | 113402110323333201 |
6 | 2110040322220421 |
7 | 134363654451361 |
oct | 17011241250775 |
9 | 3578783763084 |
10 | 1032042402301 |
11 | 368761038009 |
12 | 148024ab4711 |
13 | 764238330c1 |
14 | 37d45c272a1 |
15 | 1bca482b651 |
hex | f04a8551fd |
1032042402301 has 2 divisors, whose sum is σ = 1032042402302. Its totient is φ = 1032042402300.
The previous prime is 1032042402271. The next prime is 1032042402311.
1032042402301 is nontrivially palindromic in base 10.
1032042402301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 939716972100 + 92325430201 = 969390^2 + 303851^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 1032042402301 - 213 = 1032042394109 is a prime.
It is a super-2 number, since 2×10320424023012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032042402311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516021201150 + 516021201151.
It is an arithmetic number, because the mean of its divisors is an integer number (516021201151).
Almost surely, 21032042402301 is an apocalyptic number.
It is an amenable number.
1032042402301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032042402301 is an equidigital number, since it uses as much as digits as its factorization.
1032042402301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 22.
The spelling of 1032042402301 in words is "one trillion, thirty-two billion, forty-two million, four hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •