Search a number
-
+
13023248910 = 2357273157773
BaseRepresentation
bin11000010000011111…
…10000001000001110
31020121121112120222020
430020033300020032
5203132422431120
65552141231010
7640504534500
oct141017601016
936547476866
1013023248910
115583314731
122635562466
1312c7151b59
148b789bd70
155134e5640
hex3083f020e

13023248910 has 192 divisors, whose sum is σ = 37139591232. Its totient is φ = 2913490944.

The previous prime is 13023248759. The next prime is 13023248923. The reversal of 13023248910 is 1984232031.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 16847284 + ... + 16848056.

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

Almost surely, 213023248910 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 13023248910, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18569795616).

13023248910 is an abundant number, since it is smaller than the sum of its proper divisors (24116342322).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1027 (or 1020 counting only the distinct ones).

The product of its (nonzero) digits is 10368, while the sum is 33.

The spelling of 13023248910 in words is "thirteen billion, twenty-three million, two hundred forty-eight thousand, nine hundred ten".