Search a number
-
+
1065233050010 = 25151705452351
BaseRepresentation
bin11111000000001001101…
…01100110100110011010
310202211112220220201022022
433200010311212212122
5114423044130100020
62133210013054442
7136650316346213
oct17400465464632
93684486821268
101065233050010
11380843316978
12152548487422
13795b2c40c0c
14397b3d0440a
151ca98607625
hexf804d6699a

1065233050010 has 16 divisors (see below), whose sum is σ = 1930117635072. Its totient is φ = 423271410000.

The previous prime is 1065233050001. The next prime is 1065233050073. The reversal of 1065233050010 is 100503325601.

It is a super-2 number, since 2×10652330500102 (a number of 25 digits) contains 22 as substring.

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 7 ways as a sum of consecutive naturals, for example, 352724666 + ... + 352727685.

It is an arithmetic number, because the mean of its divisors is an integer number (120632352192).

Almost surely, 21065233050010 is an apocalyptic number.

1065233050010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

1065233050010 is a deficient number, since it is larger than the sum of its proper divisors (864884585062).

1065233050010 is a wasteful number, since it uses less digits than its factorization.

1065233050010 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 705452509.

The product of its (nonzero) digits is 2700, while the sum is 26.

Adding to 1065233050010 its reverse (100503325601), we get a palindrome (1165736375611).

The spelling of 1065233050010 in words is "one trillion, sixty-five billion, two hundred thirty-three million, fifty thousand, ten".

Divisors: 1 2 5 10 151 302 755 1510 705452351 1410904702 3527261755 7054523510 106523305001 213046610002 532616525005 1065233050010