Base | Representation |
---|---|
bin | 1001000110010111111010… |
… | …11101110000001100101101 |
3 | 2121211221211221120022211002 |
4 | 10203023331131300030231 |
5 | 10110321402241200023 |
6 | 110320321424010045 |
7 | 4133455442315210 |
oct | 443137535601455 |
9 | 77757757508732 |
10 | 20010210100013 |
11 | 6415311a33321 |
12 | 22b2142a60925 |
13 | b21c54683733 |
14 | 4d26dc271777 |
15 | 24a7a13e5b28 |
hex | 1232fd77032d |
20010210100013 has 8 divisors (see below), whose sum is σ = 23210137088832. Its totient is φ = 16895614497696.
The previous prime is 20010210099953. The next prime is 20010210100021. The reversal of 20010210100013 is 31000101201002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20010210100013 - 232 = 20005915132717 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010210099967 and 20010210100003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010210100093) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21332846120 + ... + 21332847057.
It is an arithmetic number, because the mean of its divisors is an integer number (2901267136104).
Almost surely, 220010210100013 is an apocalyptic number.
It is an amenable number.
20010210100013 is a deficient number, since it is larger than the sum of its proper divisors (3199926988819).
20010210100013 is an equidigital number, since it uses as much as digits as its factorization.
20010210100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42665693251.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20010210100013 its reverse (31000101201002), we get a palindrome (51010311301015).
The spelling of 20010210100013 in words is "twenty trillion, ten billion, two hundred ten million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •