Base | Representation |
---|---|
bin | 1001010001110010110011… |
… | …0010011100001011111101 |
3 | 1100010020100001100011212101 |
4 | 2110130230302130023331 |
5 | 2314114224434420112 |
6 | 33410224551505101 |
7 | 2102006456436136 |
oct | 224345462341375 |
9 | 40106301304771 |
10 | 10201298748157 |
11 | 328338a217a00 |
12 | 11890b6388191 |
13 | 58cc9456491a |
14 | 273a618c6c8d |
15 | 12a55c40b757 |
hex | 9472cc9c2fd |
10201298748157 has 24 divisors (see below), whose sum is σ = 11490845807168. Its totient is φ = 9046796584320.
The previous prime is 10201298748143. The next prime is 10201298748181. The reversal of 10201298748157 is 75184789210201.
It is not a de Polignac number, because 10201298748157 - 211 = 10201298746109 is a prime.
It is a super-2 number, since 2×102012987481572 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10201298748098 and 10201298748107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201296748157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5273388 + ... + 6943429.
Almost surely, 210201298748157 is an apocalyptic number.
It is an amenable number.
10201298748157 is a deficient number, since it is larger than the sum of its proper divisors (1289547059011).
10201298748157 is a wasteful number, since it uses less digits than its factorization.
10201298748157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12217009 (or 12216998 counting only the distinct ones).
The product of its (nonzero) digits is 2257920, while the sum is 55.
The spelling of 10201298748157 in words is "ten trillion, two hundred one billion, two hundred ninety-eight million, seven hundred forty-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •