Search a number
-
+
10506111051 = 3234113128349
BaseRepresentation
bin10011100100011011…
…01000100001001011
31000010012002201222010
421302031220201023
5133004031023201
64454302231003
7521231320242
oct116215504113
930105081863
1010506111051
114501475807
122052585463
13cb5801c77
14719469959
15417531bd6
hex27236884b

10506111051 has 32 divisors (see below), whose sum is σ = 15088550400. Its totient is φ = 6486022400.

The previous prime is 10506111041. The next prime is 10506111053. The reversal of 10506111051 is 15011160501.

It is a happy number.

It is a cyclic number.

It is not a de Polignac number, because 10506111051 - 26 = 10506110987 is a prime.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 356425 + ... + 384773.

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

Almost surely, 210506111051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 28547.

The product of its (nonzero) digits is 150, while the sum is 21.

Adding to 10506111051 its reverse (15011160501), we get a palindrome (25517271552).

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

Divisors: 1 3 23 41 69 123 131 393 943 2829 3013 5371 9039 16113 28349 85047 123533 370599 652027 1162309 1956081 3486927 3713719 11141157 26733107 80199321 85415537 152262479 256246611 456787437 3502037017 10506111051