Base | Representation |
---|---|
bin | 11000010011100101100100… |
… | …101010000000100100110011 |
3 | 112000111110100011010121020202 |
4 | 120103211210222000210303 |
5 | 103002413404204423042 |
6 | 1015204440545025415 |
7 | 31342131042432260 |
oct | 3023454452004463 |
9 | 460443304117222 |
10 | 106899129764147 |
11 | 31074736996336 |
12 | bba592632526b |
13 | 4785710889c86 |
14 | 1c57d345b8267 |
15 | c55a59686632 |
hex | 613964a80933 |
106899129764147 has 16 divisors (see below), whose sum is σ = 122207358744000. Its totient is φ = 91600133596800.
The previous prime is 106899129764131. The next prime is 106899129764221. The reversal of 106899129764147 is 741467921998601.
It is a cyclic number.
It is not a de Polignac number, because 106899129764147 - 24 = 106899129764131 is a prime.
It is a super-2 number, since 2×1068991297641472 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106899129764117) 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, 1309532129 + ... + 1309613757.
It is an arithmetic number, because the mean of its divisors is an integer number (7637959921500).
Almost surely, 2106899129764147 is an apocalyptic number.
106899129764147 is a deficient number, since it is larger than the sum of its proper divisors (15308228979853).
106899129764147 is an equidigital number, since it uses as much as digits as its factorization.
106899129764147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135886.
The product of its (nonzero) digits is 329204736, while the sum is 74.
The spelling of 106899129764147 in words is "one hundred six trillion, eight hundred ninety-nine billion, one hundred twenty-nine million, seven hundred sixty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •