Search a number
-
+
12321221010 = 2357229389743
BaseRepresentation
bin10110111100110011…
…01110100110010010
31011210200112212201220
423132121232212102
5200213213033020
65354342305510
7614221436100
oct133631564622
934720485656
1012321221010
11525300a78a
12247a428296
131214882727
1484c556c70
154c1a72240
hex2de66e992

12321221010 has 192 divisors, whose sum is σ = 35724499200. Its totient is φ = 2708525568.

The previous prime is 12321220997. The next prime is 12321221069. The reversal of 12321221010 is 1012212321.

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

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 95 ways as a sum of consecutive naturals, for example, 16582699 + ... + 16583441.

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

Almost surely, 212321221010 is an apocalyptic number.

12321221010 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 12321221010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17862249600).

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

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

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

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

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

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

Adding to 12321221010 its reverse (1012212321), we get a palindrome (13333433331).

The spelling of 12321221010 in words is "twelve billion, three hundred twenty-one million, two hundred twenty-one thousand, ten".