Search a number
-
+
20101101415 = 54020220283
BaseRepresentation
bin10010101110000111…
…100111011101100111
31220212212202202022121
4102232013213131213
5312131340221130
613122340210411
71311060354133
oct225607473547
956785682277
1020101101415
11858560300a
123a8b999a07
131b84615865
14d898c23c3
157c9a8bd7a
hex4ae1e7767

20101101415 has 4 divisors (see below), whose sum is σ = 24121321704. Its totient is φ = 16080881128.

The previous prime is 20101101409. The next prime is 20101101431. The reversal of 20101101415 is 51410110102.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 20101101415 - 27 = 20101101287 is a prime.

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

It is a Duffinian number.

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, 2010110137 + ... + 2010110146.

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

Almost surely, 220101101415 is an apocalyptic number.

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

20101101415 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 4020220288.

The product of its (nonzero) digits is 40, while the sum is 16.

Adding to 20101101415 its reverse (51410110102), we get a palindrome (71511211517).

The spelling of 20101101415 in words is "twenty billion, one hundred one million, one hundred one thousand, four hundred fifteen".

Divisors: 1 5 4020220283 20101101415