Base | Representation |
---|---|
bin | 11110111111100111111… |
… | …01111110010001010001 |
3 | 10202210211012100212211002 |
4 | 33133303331332101101 |
5 | 114422004202001231 |
6 | 2133121543031345 |
7 | 136640311624202 |
oct | 17376375762121 |
9 | 3683735325732 |
10 | 1064950031441 |
11 | 38070859092a |
12 | 15248973b555 |
13 | 7956940a5ca |
14 | 397884b15a9 |
15 | 1ca7d8500cb |
hex | f7f3f7e451 |
1064950031441 has 2 divisors, whose sum is σ = 1064950031442. Its totient is φ = 1064950031440.
The previous prime is 1064950031437. The next prime is 1064950031459. The reversal of 1064950031441 is 1441300594601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 805542150400 + 259407881041 = 897520^2 + 509321^2 .
It is a cyclic number.
It is not a de Polignac number, because 1064950031441 - 22 = 1064950031437 is a prime.
It is a super-3 number, since 3×10649500314413 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1064950031395 and 1064950031404.
It is not a weakly prime, because it can be changed into another prime (1064950031461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532475015720 + 532475015721.
It is an arithmetic number, because the mean of its divisors is an integer number (532475015721).
Almost surely, 21064950031441 is an apocalyptic number.
It is an amenable number.
1064950031441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1064950031441 is an equidigital number, since it uses as much as digits as its factorization.
1064950031441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 38.
The spelling of 1064950031441 in words is "one trillion, sixty-four billion, nine hundred fifty million, thirty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •