Base | Representation |
---|---|
bin | 1001100011100010000110… |
… | …0011101110010110001101 |
3 | 1101012100221220021012011120 |
4 | 2120320201203232112031 |
5 | 2334112344033102041 |
6 | 34202225241311153 |
7 | 2133015534132510 |
oct | 230704143562615 |
9 | 41170856235146 |
10 | 10506053019021 |
11 | 339065704527a |
12 | 1218187a954b9 |
13 | 5b2941346651 |
14 | 2846d2202d77 |
15 | 133447183366 |
hex | 98e218ee58d |
10506053019021 has 128 divisors (see below), whose sum is σ = 16749335592960. Its totient is φ = 5734924416000.
The previous prime is 10506053019013. The next prime is 10506053019029. The reversal of 10506053019021 is 12091035060501.
It is an interprime number because it is at equal distance from previous prime (10506053019013) and next prime (10506053019029).
It is not a de Polignac number, because 10506053019021 - 23 = 10506053019013 is a prime.
It is a super-2 number, since 2×105060530190212 (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 (10506053019029) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1604709270 + ... + 1604715816.
It is an arithmetic number, because the mean of its divisors is an integer number (130854184320).
Almost surely, 210506053019021 is an apocalyptic number.
It is an amenable number.
10506053019021 is a deficient number, since it is larger than the sum of its proper divisors (6243282573939).
10506053019021 is a wasteful number, since it uses less digits than its factorization.
10506053019021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6955.
The product of its (nonzero) digits is 8100, while the sum is 33.
Adding to 10506053019021 its reverse (12091035060501), we get a palindrome (22597088079522).
The spelling of 10506053019021 in words is "ten trillion, five hundred six billion, fifty-three million, nineteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •