Base | Representation |
---|---|
bin | 110100100001… |
… | …010110100101 |
3 | 221220111021200 |
4 | 310201112211 |
5 | 12011034401 |
6 | 1211033113 |
7 | 225012144 |
oct | 64412645 |
9 | 27814250 |
10 | 13768101 |
11 | 78541a6 |
12 | 473b799 |
13 | 2b10a09 |
14 | 1b8575b |
15 | 131e686 |
hex | d215a5 |
13768101 has 12 divisors (see below), whose sum is σ = 19938828. Its totient is φ = 9154944.
The previous prime is 13768091. The next prime is 13768109. The reversal of 13768101 is 10186731.
It can be written as a sum of positive squares in 2 ways, for example, as 6200100 + 7568001 = 2490^2 + 2751^2 .
It is not a de Polignac number, because 13768101 - 215 = 13735333 is a prime.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13768109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2131 + ... + 5663.
It is an arithmetic number, because the mean of its divisors is an integer number (1661569).
Almost surely, 213768101 is an apocalyptic number.
It is an amenable number.
13768101 is a deficient number, since it is larger than the sum of its proper divisors (6170727).
13768101 is a wasteful number, since it uses less digits than its factorization.
13768101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3972 (or 3969 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 13768101 is about 3710.5391791490. The cubic root of 13768101 is about 239.6760734116.
Adding to 13768101 its sum of digits (27), we get a triangular number (13768128 = T5247).
The spelling of 13768101 in words is "thirteen million, seven hundred sixty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •