Base | Representation |
---|---|
bin | 101111100011011100… |
… | …0110001101001100001 |
3 | 100202120222201022201001 |
4 | 1133012320301221201 |
5 | 3133120440120001 |
6 | 114525211512001 |
7 | 10243440230200 |
oct | 1370670615141 |
9 | 322528638631 |
10 | 102121020001 |
11 | 3a3447208a0 |
12 | 17960158601 |
13 | 982607a070 |
14 | 4d2aa1d237 |
15 | 29ca555001 |
hex | 17c6e31a61 |
102121020001 has 48 divisors (see below), whose sum is σ = 140628616128. Its totient is φ = 72892310400.
The previous prime is 102121019969. The next prime is 102121020017. The reversal of 102121020001 is 100020121201.
It is not a de Polignac number, because 102121020001 - 25 = 102121019969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102121020001.
It is not an unprimeable number, because it can be changed into a prime (102121320001) 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 47 ways as a sum of consecutive naturals, for example, 862291 + ... + 973543.
It is an arithmetic number, because the mean of its divisors is an integer number (2929762836).
Almost surely, 2102121020001 is an apocalyptic number.
102121020001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102121020001 is a deficient number, since it is larger than the sum of its proper divisors (38507596127).
102121020001 is a wasteful number, since it uses less digits than its factorization.
102121020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111422 (or 111415 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 102121020001 its reverse (100020121201), we get a palindrome (202141141202).
The spelling of 102121020001 in words is "one hundred two billion, one hundred twenty-one million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •