Base | Representation |
---|---|
bin | 10111001110000100101000… |
… | …101100000000010011011100 |
3 | 111101120210001010112020010101 |
4 | 113032010220230000103130 |
5 | 101341132100211134322 |
6 | 1001110130531350444 |
7 | 30340036222534504 |
oct | 2716045054002334 |
9 | 441523033466111 |
10 | 102122120021212 |
11 | 2a5a2825485425 |
12 | b553b4b452424 |
13 | 44ca0c7b724a5 |
14 | 1b30a463c6a04 |
15 | bc166d922327 |
hex | 5ce128b004dc |
102122120021212 has 48 divisors (see below), whose sum is σ = 180048100246560. Its totient is φ = 50680920326400.
The previous prime is 102122120021197. The next prime is 102122120021213. The reversal of 102122120021212 is 212120021221201.
It is a self number, because there is not a number n which added to its sum of digits gives 102122120021212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102122120021213) 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 15 ways as a sum of consecutive naturals, for example, 4330683262 + ... + 4330706842.
It is an arithmetic number, because the mean of its divisors is an integer number (3751002088470).
Almost surely, 2102122120021212 is an apocalyptic number.
It is an amenable number.
102122120021212 is a deficient number, since it is larger than the sum of its proper divisors (77925980225348).
102122120021212 is a wasteful number, since it uses less digits than its factorization.
102122120021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35062 (or 35060 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 102122120021212 its reverse (212120021221201), we get a palindrome (314242141242413).
The spelling of 102122120021212 in words is "one hundred two trillion, one hundred twenty-two billion, one hundred twenty million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •