Base | Representation |
---|---|
bin | 10110110000101011010110… |
… | …000111100111001010010100 |
3 | 111010102200000110201000212111 |
4 | 112300223112013213022110 |
5 | 101110033100112321322 |
6 | 552522134150400404 |
7 | 30041065233635221 |
oct | 2660532607471224 |
9 | 433380013630774 |
10 | 100102100120212 |
11 | 29994075952713 |
12 | b28855a960104 |
13 | 43b1783a86168 |
14 | 1aa0d78b50948 |
15 | b88d43097177 |
hex | 5b0ad61e7294 |
100102100120212 has 12 divisors (see below), whose sum is σ = 175526942957856. Its totient is φ = 49951544989400.
The previous prime is 100102100120203. The next prime is 100102100120213. The reversal of 100102100120212 is 212021001201001.
It is a junction number, because it is equal to n+sod(n) for n = 100102100120192 and 100102100120201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100102100120213) 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 3 ways as a sum of consecutive naturals, for example, 24876265414 + ... + 24876269437.
It is an arithmetic number, because the mean of its divisors is an integer number (14627245246488).
Almost surely, 2100102100120212 is an apocalyptic number.
It is an amenable number.
100102100120212 is a deficient number, since it is larger than the sum of its proper divisors (75424842837644).
100102100120212 is a wasteful number, since it uses less digits than its factorization.
100102100120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49752535358 (or 49752535356 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100102100120212 its reverse (212021001201001), we get a palindrome (312123101321213).
The spelling of 100102100120212 in words is "one hundred trillion, one hundred two billion, one hundred million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •