Base | Representation |
---|---|
bin | 10011001101101011… |
… | …00100001111011101 |
3 | 222121212222010112100 |
4 | 21212311210033131 |
5 | 132111201041301 |
6 | 4423323355313 |
7 | 513423126015 |
oct | 114665441735 |
9 | 28555863470 |
10 | 10315252701 |
11 | 4413767036 |
12 | 1bba682b39 |
13 | c850c8930 |
14 | 6dbd86c45 |
15 | 4058d1286 |
hex | 266d643dd |
10315252701 has 72 divisors (see below), whose sum is σ = 16841377280. Its totient is φ = 6046814592.
The previous prime is 10315252693. The next prime is 10315252711. The reversal of 10315252701 is 10725251301.
It is not a de Polignac number, because 10315252701 - 23 = 10315252693 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10315252711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 7772700 + ... + 7774026.
Almost surely, 210315252701 is an apocalyptic number.
It is an amenable number.
10315252701 is a deficient number, since it is larger than the sum of its proper divisors (6526124579).
10315252701 is a wasteful number, since it uses less digits than its factorization.
10315252701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1483 (or 1451 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The spelling of 10315252701 in words is "ten billion, three hundred fifteen million, two hundred fifty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •