Base | Representation |
---|---|
bin | 111111100001001… |
… | …011110111001110 |
3 | 2202021020100010012 |
4 | 333201023313032 |
5 | 4140302221300 |
6 | 253424513222 |
7 | 35256664661 |
oct | 7741136716 |
9 | 2667210105 |
10 | 1065663950 |
11 | 4a75a310a |
12 | 258a7b812 |
13 | 13ca1b1b0 |
14 | a17616d8 |
15 | 63852435 |
hex | 3f84bdce |
1065663950 has 48 divisors (see below), whose sum is σ = 2139821376. Its totient is φ = 392515200.
The previous prime is 1065663931. The next prime is 1065663983. The reversal of 1065663950 is 593665601.
It is a super-2 number, since 2×10656639502 = 2271279308659205000, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1065663898 and 1065663907.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 299180 + ... + 302720.
It is an arithmetic number, because the mean of its divisors is an integer number (44579612).
Almost surely, 21065663950 is an apocalyptic number.
1065663950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1065663950 is an abundant number, since it is smaller than the sum of its proper divisors (1074157426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1065663950 is a wasteful number, since it uses less digits than its factorization.
1065663950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4029 (or 4024 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 41.
The square root of 1065663950 is about 32644.5087265837. The cubic root of 1065663950 is about 1021.4256464664.
The spelling of 1065663950 in words is "one billion, sixty-five million, six hundred sixty-three thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •