Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …010100110000110101000010 |
3 | 111101111200012200011002111222 |
4 | 113031300020110300311002 |
5 | 101340302002132033442 |
6 | 1001052050041435042 |
7 | 30335326466401505 |
oct | 2715601024606502 |
9 | 441450180132458 |
10 | 102100102221122 |
11 | 2a594456a61325 |
12 | b54b82579ba82 |
13 | 44c7cc942a505 |
14 | 1b2d95813113c |
15 | bc0cd09798d2 |
hex | 5cdc08530d42 |
102100102221122 has 8 divisors (see below), whose sum is σ = 153760313305872. Its totient is φ = 50846664452500.
The previous prime is 102100102221119. The next prime is 102100102221127. The reversal of 102100102221122 is 221122201001201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 102100102221122.
It is not an unprimeable number, because it can be changed into a prime (102100102221127) 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 3 ways as a sum of consecutive naturals, for example, 101693328404 + ... + 101693329407.
It is an arithmetic number, because the mean of its divisors is an integer number (19220039163234).
Almost surely, 2102100102221122 is an apocalyptic number.
102100102221122 is a deficient number, since it is larger than the sum of its proper divisors (51660211084750).
102100102221122 is a wasteful number, since it uses less digits than its factorization.
102100102221122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203386658064.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102100102221122 its reverse (221122201001201), we get a palindrome (323222303222323).
The spelling of 102100102221122 in words is "one hundred two trillion, one hundred billion, one hundred two million, two hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.003 sec. • engine limits •