Base | Representation |
---|---|
bin | 110010001000… |
… | …101010101101 |
3 | 220201201101201 |
4 | 302020222231 |
5 | 11331031301 |
6 | 1145405501 |
7 | 216465625 |
oct | 62105255 |
9 | 26651351 |
10 | 13142701 |
11 | 7467340 |
12 | 4499891 |
13 | 2952160 |
14 | 1a61885 |
15 | 1249201 |
hex | c88aad |
13142701 has 16 divisors (see below), whose sum is σ = 15664320. Its totient is φ = 10869120.
The previous prime is 13142693. The next prime is 13142711. The reversal of 13142701 is 10724131.
13142701 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13142701 - 23 = 13142693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13142711) 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 15 ways as a sum of consecutive naturals, for example, 9810 + ... + 11068.
It is an arithmetic number, because the mean of its divisors is an integer number (979020).
Almost surely, 213142701 is an apocalyptic number.
13142701 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13142701 is a deficient number, since it is larger than the sum of its proper divisors (2521619).
13142701 is a wasteful number, since it uses less digits than its factorization.
13142701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1356.
The product of its (nonzero) digits is 168, while the sum is 19.
The square root of 13142701 is about 3625.2863335191. The cubic root of 13142701 is about 235.9906931597.
Adding to 13142701 its reverse (10724131), we get a palindrome (23866832).
The spelling of 13142701 in words is "thirteen million, one hundred forty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •