Base | Representation |
---|---|
bin | 1001011101001100100100… |
… | …0011001001111100011101 |
3 | 1100210221222022122011122001 |
4 | 2113103021003021330131 |
5 | 2330321423114411101 |
6 | 34040223244522301 |
7 | 2122113105000160 |
oct | 227231103117435 |
9 | 40727868564561 |
10 | 10397193903901 |
11 | 33494749a4932 |
12 | 11bb067250391 |
13 | 5a55b331396c |
14 | 27d326761ad7 |
15 | 1306c52ea901 |
hex | 974c90c9f1d |
10397193903901 has 16 divisors (see below), whose sum is σ = 11958948376704. Its totient is φ = 8854556877504.
The previous prime is 10397193903893. The next prime is 10397193903917. The reversal of 10397193903901 is 10930939179301.
10397193903901 is digitally balanced in base 2, 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 10397193903901 - 23 = 10397193903893 is a prime.
It is a super-2 number, since 2×103971939039012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10397193903961) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17571006 + ... + 18153088.
It is an arithmetic number, because the mean of its divisors is an integer number (747434273544).
Almost surely, 210397193903901 is an apocalyptic number.
It is an amenable number.
10397193903901 is a deficient number, since it is larger than the sum of its proper divisors (1561754472803).
10397193903901 is a wasteful number, since it uses less digits than its factorization.
10397193903901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 598500.
The product of its (nonzero) digits is 1240029, while the sum is 55.
The spelling of 10397193903901 in words is "ten trillion, three hundred ninety-seven billion, one hundred ninety-three million, nine hundred three thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •