Base | Representation |
---|---|
bin | 11110111111101100111… |
… | …10110101100101101001 |
3 | 10202210221010201022200000 |
4 | 33133312132311211221 |
5 | 114422101000413230 |
6 | 2133130050533213 |
7 | 136641333226542 |
oct | 17376636654551 |
9 | 3683833638600 |
10 | 1064992201065 |
11 | 38072a373561 |
12 | 15249b897209 |
13 | 79575083850 |
14 | 3978dd2b4c9 |
15 | 1ca823ceb60 |
hex | f7f67b5969 |
1064992201065 has 48 divisors (see below), whose sum is σ = 2061614563008. Its totient is φ = 524303845056.
The previous prime is 1064992201057. The next prime is 1064992201151. The reversal of 1064992201065 is 5601022994601.
It is not a de Polignac number, because 1064992201065 - 23 = 1064992201057 is a prime.
It is a super-2 number, since 2×10649922010652 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1064992201065.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 33697159 + ... + 33728748.
It is an arithmetic number, because the mean of its divisors is an integer number (42950303396).
Almost surely, 21064992201065 is an apocalyptic number.
1064992201065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1064992201065 is a deficient number, since it is larger than the sum of its proper divisors (996622361943).
1064992201065 is an equidigital number, since it uses as much as digits as its factorization.
1064992201065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67425940 (or 67425928 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The spelling of 1064992201065 in words is "one trillion, sixty-four billion, nine hundred ninety-two million, two hundred one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •