Base | Representation |
---|---|
bin | 1100000100001… |
… | …00010000010101 |
3 | 21001102202011211 |
4 | 12002010100111 |
5 | 201402030023 |
6 | 14013101421 |
7 | 2336141230 |
oct | 602042025 |
9 | 231382154 |
10 | 101205013 |
11 | 52144908 |
12 | 29a87871 |
13 | 17c76130 |
14 | d626417 |
15 | 8d41a0d |
hex | 6084415 |
101205013 has 8 divisors (see below), whose sum is σ = 124560128. Its totient is φ = 80074224.
The previous prime is 101205011. The next prime is 101205017. The reversal of 101205013 is 310502101.
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 101205013 - 21 = 101205011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 101204984 and 101205002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101205011) 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, 555981 + ... + 556162.
It is an arithmetic number, because the mean of its divisors is an integer number (15570016).
Almost surely, 2101205013 is an apocalyptic number.
101205013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101205013 is a deficient number, since it is larger than the sum of its proper divisors (23355115).
101205013 is a wasteful number, since it uses less digits than its factorization.
101205013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1112163.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 101205013 is about 10060.0702283831. The cubic root of 101205013 is about 466.0158360033.
Adding to 101205013 its reverse (310502101), we get a palindrome (411707114).
The spelling of 101205013 in words is "one hundred one million, two hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •