Base | Representation |
---|---|
bin | 10011000001001000… |
… | …11100001100101101 |
3 | 222100120002211011100 |
4 | 21200210130030231 |
5 | 131402241200023 |
6 | 4405045513313 |
7 | 511005263301 |
oct | 114044341455 |
9 | 28316084140 |
10 | 10210100013 |
11 | 436a376293 |
12 | 1b8b412839 |
13 | c6939c9c9 |
14 | 6cc013d01 |
15 | 3eb55ec43 |
hex | 26091c32d |
10210100013 has 12 divisors (see below), whose sum is σ = 15146515228. Its totient is φ = 6622767360.
The previous prime is 10210100003. The next prime is 10210100027. The reversal of 10210100013 is 31000101201.
It can be written as a sum of positive squares in 2 ways, for example, as 9096009129 + 1114090884 = 95373^2 + 33378^2 .
It is not a de Polignac number, because 10210100013 - 24 = 10210099997 is a prime.
It is a super-2 number, since 2×102101000132 (a number of 21 digits) contains 22 as substring.
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 = 10210099968 and 10210100004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210100003) 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, 15330148 + ... + 15330813.
Almost surely, 210210100013 is an apocalyptic number.
It is an amenable number.
10210100013 is a deficient number, since it is larger than the sum of its proper divisors (4936415215).
10210100013 is a wasteful number, since it uses less digits than its factorization.
10210100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30661004 (or 30661001 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10210100013 its reverse (31000101201), we get a palindrome (41210201214).
The spelling of 10210100013 in words is "ten billion, two hundred ten million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •