Base | Representation |
---|---|
bin | 11000110010100010111101… |
… | …011000000000000001110110 |
3 | 112022000211210002120110222112 |
4 | 120302202331120000001312 |
5 | 103242243013004331222 |
6 | 1023514050242531022 |
7 | 31651625311666163 |
oct | 3062427530000166 |
9 | 468024702513875 |
10 | 109026627027062 |
11 | 31814a29702898 |
12 | 1028a110966a72 |
13 | 48ab222648944 |
14 | 1ccccb9dad06a |
15 | c9107590abe2 |
hex | 6328bd600076 |
109026627027062 has 32 divisors (see below), whose sum is σ = 170948204656320. Its totient is φ = 52098709956480.
The previous prime is 109026627027061. The next prime is 109026627027103. The reversal of 109026627027062 is 260720726620901.
It is a self number, because there is not a number n which added to its sum of digits gives 109026627027062.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109026627027061) 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, 13329737 + ... + 19893092.
It is an arithmetic number, because the mean of its divisors is an integer number (5342131395510).
Almost surely, 2109026627027062 is an apocalyptic number.
109026627027062 is a deficient number, since it is larger than the sum of its proper divisors (61921577629258).
109026627027062 is a wasteful number, since it uses less digits than its factorization.
109026627027062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33223656.
The product of its (nonzero) digits is 1524096, while the sum is 50.
The spelling of 109026627027062 in words is "one hundred nine trillion, twenty-six billion, six hundred twenty-seven million, twenty-seven thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •