Search a number
-
+
20001201310 = 252000120131
BaseRepresentation
bin10010101000001010…
…100001110010011110
31220121220210022010201
4102220022201302132
5311430301420220
613104411054114
71305435256156
oct225012416236
956556708121
1020001201310
11853417a642
123a6244133a
131b69a0867c
14d7a519766
157c0e06d0a
hex4a82a1c9e

20001201310 has 8 divisors (see below), whose sum is σ = 36002162376. Its totient is φ = 8000480520.

The previous prime is 20001201299. The next prime is 20001201343. The reversal of 20001201310 is 1310210002.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 2000120131 = 20001201310 / (2 + 0 + 0 + 0 + 1 + 2 + 0 + 1 + 3 + 1 + 0).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1000060056 + ... + 1000060075.

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

Almost surely, 220001201310 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2000120138.

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

Adding to 20001201310 its reverse (1310210002), we get a palindrome (21311411312).

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

Divisors: 1 2 5 10 2000120131 4000240262 10000600655 20001201310