Base | Representation |
---|---|
bin | 1001001001101100010001… |
… | …0000011101000111100101 |
3 | 1022121221001110201202002212 |
4 | 2102123010100131013211 |
5 | 2304324143122231031 |
6 | 33222245005213205 |
7 | 2055651240165410 |
oct | 222330420350745 |
9 | 38557043652085 |
10 | 10062106055141 |
11 | 322a351605518 |
12 | 116612ab61205 |
13 | 57cb1101368a |
14 | 26b0195a6b77 |
15 | 126b1250712b |
hex | 926c441d1e5 |
10062106055141 has 32 divisors (see below), whose sum is σ = 11754887639040. Its totient is φ = 8434793606400.
The previous prime is 10062106055107. The next prime is 10062106055153. The reversal of 10062106055141 is 14155060126001.
It is a de Polignac number, because none of the positive numbers 2k-10062106055141 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10062106055098 and 10062106055107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10062106015141) 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 31 ways as a sum of consecutive naturals, for example, 578639075 + ... + 578656463.
It is an arithmetic number, because the mean of its divisors is an integer number (367340238720).
Almost surely, 210062106055141 is an apocalyptic number.
It is an amenable number.
10062106055141 is a deficient number, since it is larger than the sum of its proper divisors (1692781583899).
10062106055141 is a wasteful number, since it uses less digits than its factorization.
10062106055141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25125.
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 10062106055141 in words is "ten trillion, sixty-two billion, one hundred six million, fifty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.201 sec. • engine limits •