Search a number
-
+
10505106051 = 3111013151847
BaseRepresentation
bin10011100100010011…
…10011001010000011
31000010010012200100220
421302021303022003
5133003301343201
64454224514123
7521216633226
oct116211631203
930103180326
1010505106051
114500949730
12205217b943
13cb553c6ab
147192875bd
154173d4036
hex272273283

10505106051 has 16 divisors (see below), whose sum is σ = 15431447808. Its totient is φ = 6303692000.

The previous prime is 10505106049. The next prime is 10505106067. The reversal of 10505106051 is 15060150501.

It is a cyclic number.

It is not a de Polignac number, because 10505106051 - 21 = 10505106049 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (10505106151) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1572591 + ... + 1579256.

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

Almost surely, 210505106051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 3151962.

The product of its (nonzero) digits is 750, while the sum is 24.

Adding to 10505106051 its reverse (15060150501), we get a palindrome (25565256552).

The spelling of 10505106051 in words is "ten billion, five hundred five million, one hundred six thousand, fifty-one".

Divisors: 1 3 11 33 101 303 1111 3333 3151847 9455541 34670317 104010951 318336547 955009641 3501702017 10505106051