Search a number
-
+
10505611023 = 317205992373
BaseRepresentation
bin10011100100010111…
…01110011100001111
31000010011011100001120
421302023232130033
5133003414023043
64454243412023
7521224135365
oct116213563417
930104140046
1010505611023
114501164066
122052384013
13cb56884ab
14719379635
15417483983
hex2722ee70f

10505611023 has 8 divisors (see below), whose sum is σ = 14831450928. Its totient is φ = 6591755904.

The previous prime is 10505611019. The next prime is 10505611037. The reversal of 10505611023 is 32011650501.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10505611023 - 22 = 10505611019 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10505610984 and 10505611002.

It is a congruent number.

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

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, 102996136 + ... + 102996237.

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

Almost surely, 210505611023 is an apocalyptic number.

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

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

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

The sum of its prime factors is 205992393.

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

The spelling of 10505611023 in words is "ten billion, five hundred five million, six hundred eleven thousand, twenty-three".

Divisors: 1 3 17 51 205992373 617977119 3501870341 10505611023