Base | Representation |
---|---|
bin | 10111001110000011100101… |
… | …111011100010100010000101 |
3 | 111101120200011002001021102202 |
4 | 113032003211323202202011 |
5 | 101341122302001120401 |
6 | 1001105423442044245 |
7 | 30336666402636236 |
oct | 2716034573424205 |
9 | 441520132037382 |
10 | 102121000020101 |
11 | 2a5a2300249a77 |
12 | b553898349685 |
13 | 44c9c79b0aa3a |
14 | 1b3097b75d08d |
15 | bc160543a06b |
hex | 5ce0e5ee2885 |
102121000020101 has 16 divisors (see below), whose sum is σ = 103388573644800. Its totient is φ = 100861572651840.
The previous prime is 102121000020077. The next prime is 102121000020103. The reversal of 102121000020101 is 101020000121201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102121000020101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102121000020103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26664875 + ... + 30253223.
It is an arithmetic number, because the mean of its divisors is an integer number (6461785852800).
Almost surely, 2102121000020101 is an apocalyptic number.
It is an amenable number.
102121000020101 is a deficient number, since it is larger than the sum of its proper divisors (1267573624699).
102121000020101 is a wasteful number, since it uses less digits than its factorization.
102121000020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3589484.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102121000020101 its reverse (101020000121201), we get a palindrome (203141000141302).
The spelling of 102121000020101 in words is "one hundred two trillion, one hundred twenty-one billion, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •