Search a number
-
+
21010100013 = 327333493651
BaseRepresentation
bin10011100100010011…
…001010111100101101
32000020020012122222100
4103210103022330231
5321012041200023
613352451205313
71342435621620
oct234423127455
960206178870
1021010100013
118a01721121
1240a42a6839
131c9aa40056
141034501db7
1582e794c43
hex4e44caf2d

21010100013 has 12 divisors (see below), whose sum is σ = 34683339808. Its totient is φ = 12005771400.

The previous prime is 21010099987. The next prime is 21010100021. The reversal of 21010100013 is 31000101012.

It is not a de Polignac number, because 21010100013 - 26 = 21010099949 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 21010099968 and 21010100004.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (21010150013) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 166746763 + ... + 166746888.

Almost surely, 221010100013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 21010100013 its reverse (31000101012), we get a palindrome (52010201025).

Subtracting 21010100013 from its reverse (31000101012), we obtain a palindrome (9990000999).

The spelling of 21010100013 in words is "twenty-one billion, ten million, one hundred thousand, thirteen".

Divisors: 1 3 7 9 21 63 333493651 1000480953 2334455557 3001442859 7003366671 21010100013