Base | Representation |
---|---|
bin | 1001100110001101010001… |
… | …0100000101000000100001 |
3 | 1101100202120010211122120012 |
4 | 2121203110110011000201 |
5 | 2340340444414242121 |
6 | 34235304521254305 |
7 | 2136233303442140 |
oct | 231432424050041 |
9 | 41322503748505 |
10 | 10552001712161 |
11 | 33a9095970538 |
12 | 1225070034395 |
13 | 5b708496c780 |
14 | 286a10865757 |
15 | 13473601ac5b |
hex | 998d4505021 |
10552001712161 has 32 divisors (see below), whose sum is σ = 12999588618240. Its totient is φ = 8340798413376.
The previous prime is 10552001712143. The next prime is 10552001712269. The reversal of 10552001712161 is 16121710025501.
It is not a de Polignac number, because 10552001712161 - 218 = 10552001450017 is a prime.
It is a super-2 number, since 2×105520017121612 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10552001711161) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 498218870 + ... + 498240048.
It is an arithmetic number, because the mean of its divisors is an integer number (406237144320).
Almost surely, 210552001712161 is an apocalyptic number.
It is an amenable number.
10552001712161 is a deficient number, since it is larger than the sum of its proper divisors (2447586906079).
10552001712161 is a wasteful number, since it uses less digits than its factorization.
10552001712161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26213.
The product of its (nonzero) digits is 4200, while the sum is 32.
Adding to 10552001712161 its reverse (16121710025501), we get a palindrome (26673711737662).
The spelling of 10552001712161 in words is "ten trillion, five hundred fifty-two billion, one million, seven hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •