Search a number
-
+
102011202330 = 2353400373411
BaseRepresentation
bin101111100000001010…
…1110110101100011010
3100202022100002000011220
41133000111312230122
53132404331433310
6114510250032510
710240634625102
oct1370025665432
9322270060156
10102011202330
113a298734194
121792b418736
1398093a99ab
144d1a1d4202
1529c0ab1670
hex17c0576b1a

102011202330 has 16 divisors (see below), whose sum is σ = 244826885664. Its totient is φ = 27202987280.

The previous prime is 102011202289. The next prime is 102011202347. The reversal of 102011202330 is 33202110201.

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

It is a Curzon 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, 1700186676 + ... + 1700186735.

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

Almost surely, 2102011202330 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 3400373421.

The product of its (nonzero) digits is 72, while the sum is 15.

Adding to 102011202330 its reverse (33202110201), we get a palindrome (135213312531).

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

Divisors: 1 2 3 5 6 10 15 30 3400373411 6800746822 10201120233 17001867055 20402240466 34003734110 51005601165 102011202330