Base | Representation |
---|---|
bin | 1001011011100000000100… |
… | …1110001111010101101001 |
3 | 1100201011210201210221122201 |
4 | 2112320001032033111221 |
5 | 2324332302310000401 |
6 | 34015005404020201 |
7 | 2120032323120064 |
oct | 226700116172551 |
9 | 40634721727581 |
10 | 10368071562601 |
11 | 3338090113875 |
12 | 11b549a231661 |
13 | 5a2921a2224c |
14 | 27bb62ad98db |
15 | 12ea6d788b01 |
hex | 96e0138f569 |
10368071562601 has 9 divisors (see below), whose sum is σ = 10942544528253. Its totient is φ = 9822325626540.
The previous prime is 10368071562533. The next prime is 10368071562613. The reversal of 10368071562601 is 10626517086301.
It is a happy number.
The square root of 10368071562601 is 3219949.
It is a perfect power (a square), and thus also a powerful number.
It is a de Polignac number, because none of the positive numbers 2k-10368071562601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10368071562671) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 61094296 + ... + 61263766.
It is an arithmetic number, because the mean of its divisors is an integer number (1215838280917).
Almost surely, 210368071562601 is an apocalyptic number.
10368071562601 is the 3219949-th square number.
10368071562601 is the 1609975-th centered octagonal number.
It is an amenable number.
10368071562601 is a deficient number, since it is larger than the sum of its proper divisors (574472965652).
10368071562601 is an frugal number, since it uses more digits than its factorization.
10368071562601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338980 (or 169490 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 10368071562601 in words is "ten trillion, three hundred sixty-eight billion, seventy-one million, five hundred sixty-two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •