Base | Representation |
---|---|
bin | 10111001100111000001011… |
… | …001010000111100011100101 |
3 | 111101021221010110021012120002 |
4 | 113030320023022013203211 |
5 | 101333310430134021013 |
6 | 1001004312123551045 |
7 | 30331101552665042 |
oct | 2714701312074345 |
9 | 441257113235502 |
10 | 102040020220133 |
11 | 2a570a25266756 |
12 | b54005838b485 |
13 | 44c24429bc238 |
14 | 1b2aa988141c9 |
15 | bbe465e2a358 |
hex | 5cce0b2878e5 |
102040020220133 has 16 divisors (see below), whose sum is σ = 107650786629120. Its totient is φ = 96453350334576.
The previous prime is 102040020220121. The next prime is 102040020220153. The reversal of 102040020220133 is 331022020040201.
It is a cyclic number.
It is not a de Polignac number, because 102040020220133 - 218 = 102040019957989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102040020220153) 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, 49728566 + ... + 51739832.
It is an arithmetic number, because the mean of its divisors is an integer number (6728174164320).
Almost surely, 2102040020220133 is an apocalyptic number.
It is an amenable number.
102040020220133 is a deficient number, since it is larger than the sum of its proper divisors (5610766408987).
102040020220133 is a wasteful number, since it uses less digits than its factorization.
102040020220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2017256.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 102040020220133 its reverse (331022020040201), we get a palindrome (433062040260334).
The spelling of 102040020220133 in words is "one hundred two trillion, forty billion, twenty million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •