Search a number
-
+
2020121001000 = 23325359113131257
BaseRepresentation
bin11101011001011000100…
…110000011110000101000
321011010021201001121101100
4131121120212003300220
5231044201434013000
64144010351521400
7265643324122404
oct35313046036050
97133251047340
102020121001000
11709801705733
1228761a529260
1311865c02671b
146dabac72104
153783469aa00
hex1d658983c28

2020121001000 has 768 divisors, whose sum is σ = 7086127276800. Its totient is φ = 518848512000.

The previous prime is 2020121000959. The next prime is 2020121001053. The reversal of 2020121001000 is 1001210202.

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

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 7860392872 + ... + 7860393128.

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

Almost surely, 22020121001000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

2020121001000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 8, while the sum is 9.

Adding to 2020121001000 its reverse (1001210202), we get a palindrome (2021122211202).

The spelling of 2020121001000 in words is "two trillion, twenty billion, one hundred twenty-one million, one thousand".