Base | Representation |
---|---|
bin | 100001000001001000… |
… | …010110010101100101 |
3 | 10101111202000212020112 |
4 | 201001020112111211 |
5 | 1040101311233203 |
6 | 24141524542405 |
7 | 2363354551013 |
oct | 410110262545 |
9 | 111452025215 |
10 | 35452446053 |
11 | 14042a884a2 |
12 | 6a54b51a05 |
13 | 345cb98b3b |
14 | 1a046438b3 |
15 | dc76536d8 |
hex | 841216565 |
35452446053 has 2 divisors, whose sum is σ = 35452446054. Its totient is φ = 35452446052.
The previous prime is 35452446019. The next prime is 35452446059. The reversal of 35452446053 is 35064425453.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21419200609 + 14033245444 = 146353^2 + 118462^2 .
It is a cyclic number.
It is not a de Polignac number, because 35452446053 - 26 = 35452445989 is a prime.
It is a super-2 number, since 2×354524460532 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 35452446053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (35452446059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17726223026 + 17726223027.
It is an arithmetic number, because the mean of its divisors is an integer number (17726223027).
Almost surely, 235452446053 is an apocalyptic number.
It is an amenable number.
35452446053 is a deficient number, since it is larger than the sum of its proper divisors (1).
35452446053 is an equidigital number, since it uses as much as digits as its factorization.
35452446053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864000, while the sum is 41.
The spelling of 35452446053 in words is "thirty-five billion, four hundred fifty-two million, four hundred forty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •