Base | Representation |
---|---|
bin | 101000010010110… |
… | …0000100101110101 |
3 | 10111020001020012012 |
4 | 1100211200211311 |
5 | 10232103310401 |
6 | 342054134005 |
7 | 45334616261 |
oct | 12045404565 |
9 | 3436036165 |
10 | 1352010101 |
11 | 6341a1222 |
12 | 318951305 |
13 | 1871482a0 |
14 | cb7bd0a1 |
15 | 7da658bb |
hex | 50960975 |
1352010101 has 8 divisors (see below), whose sum is σ = 1456476000. Its totient is φ = 1247610672.
The previous prime is 1352010097. The next prime is 1352010133. The reversal of 1352010101 is 1010102531.
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 1352010101 - 22 = 1352010097 is a prime.
It is a Duffinian number.
1352010101 is a modest number, since divided by 10101 gives 1352 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1352010181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30626 + ... + 60348.
It is an arithmetic number, because the mean of its divisors is an integer number (182059500).
Almost surely, 21352010101 is an apocalyptic number.
It is an amenable number.
1352010101 is a deficient number, since it is larger than the sum of its proper divisors (104465899).
1352010101 is a wasteful number, since it uses less digits than its factorization.
1352010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33235.
The product of its (nonzero) digits is 30, while the sum is 14.
The square root of 1352010101 is about 36769.6899769362. The cubic root of 1352010101 is about 1105.7577164841.
Adding to 1352010101 its reverse (1010102531), we get a palindrome (2362112632).
The spelling of 1352010101 in words is "one billion, three hundred fifty-two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •