Base | Representation |
---|---|
bin | 100001010110011110100001… |
… | …110011010100100110000001 |
3 | 201020100111002100021200220110 |
4 | 201112132201303110212001 |
5 | 123211201413013224134 |
6 | 1235543532144501533 |
7 | 42616201450331364 |
oct | 4126364163244601 |
9 | 636314070250813 |
10 | 146680142711169 |
11 | 42811776687291 |
12 | 1454b71701a8a9 |
13 | 63acb5527bb82 |
14 | 28314dd0480db |
15 | 11e57490a07e9 |
hex | 8567a1cd4981 |
146680142711169 has 16 divisors (see below), whose sum is σ = 195899093549568. Its totient is φ = 97623982390272.
The previous prime is 146680142711149. The next prime is 146680142711173. The reversal of 146680142711169 is 961117241086641.
It is not a de Polignac number, because 146680142711169 - 216 = 146680142645633 is a prime.
It is a super-2 number, since 2×1466801427111692 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (146680142711149) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 109938979 + ... + 111265175.
It is an arithmetic number, because the mean of its divisors is an integer number (12243693346848).
Almost surely, 2146680142711169 is an apocalyptic number.
It is an amenable number.
146680142711169 is a deficient number, since it is larger than the sum of its proper divisors (49218950838399).
146680142711169 is a wasteful number, since it uses less digits than its factorization.
146680142711169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1387544.
The product of its (nonzero) digits is 3483648, while the sum is 57.
The spelling of 146680142711169 in words is "one hundred forty-six trillion, six hundred eighty billion, one hundred forty-two million, seven hundred eleven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •