Search a number
-
+
102011001310 = 2528549357319
BaseRepresentation
bin101111100000001010…
…1000101100111011110
3100202022022200210102201
41133000111011213132
53132404304020220
6114510241442114
710240633130041
oct1370025054736
9322268623381
10102011001310
113a298607159
121792b34033a
13980933934a
144d1a180c58
1529c0a71d0a
hex17c05459de

102011001310 has 16 divisors (see below), whose sum is σ = 183626748000. Its totient is φ = 40802857056.

The previous prime is 102011001299. The next prime is 102011001331. The reversal of 102011001310 is 13100110201.

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

It is a Harshad number since it is a multiple of its sum of digits (10).

It is a congruent number.

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, 106831 + ... + 464149.

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

Almost surely, 2102011001310 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 385875.

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 102011001310 its reverse (13100110201), we get a palindrome (115111111511).

The spelling of 102011001310 in words is "one hundred two billion, eleven million, one thousand, three hundred ten".

Divisors: 1 2 5 10 28549 57098 142745 285490 357319 714638 1786595 3573190 10201100131 20402200262 51005500655 102011001310