Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001011101110000001101101 |
3 | 111020121111122201122202222000 |
4 | 112331233211023232001231 |
5 | 101214241000230120023 |
6 | 554450432051042513 |
7 | 30163003115440134 |
oct | 2675574513560155 |
9 | 436544581582860 |
10 | 101000001020013 |
11 | 2a1aa950569457 |
12 | b3b2587ba0439 |
13 | 444834a6aab34 |
14 | 1ad25d744291b |
15 | ba2396188243 |
hex | 5bdbe52ee06d |
101000001020013 has 16 divisors (see below), whose sum is σ = 158431374149760. Its totient is φ = 63372549659328.
The previous prime is 101000001019991. The next prime is 101000001020053. The reversal of 101000001020013 is 310020100000101.
It is not a de Polignac number, because 101000001020013 - 216 = 101000000954477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101000001019977 and 101000001020004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000001020053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 110021787145 + ... + 110021788062.
It is an arithmetic number, because the mean of its divisors is an integer number (9901960884360).
Almost surely, 2101000001020013 is an apocalyptic number.
It is an amenable number.
101000001020013 is a deficient number, since it is larger than the sum of its proper divisors (57431373129747).
101000001020013 is a wasteful number, since it uses less digits than its factorization.
101000001020013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220043575233 (or 220043575227 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 101000001020013 its reverse (310020100000101), we get a palindrome (411020101020114).
The spelling of 101000001020013 in words is "one hundred one trillion, one million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •