Base | Representation |
---|---|
bin | 110001110011010001… |
… | …0101010110010101101 |
3 | 101020001022202201001202 |
4 | 1203212202222302231 |
5 | 3223011422003312 |
6 | 121044130415245 |
7 | 10504151015240 |
oct | 1434642526255 |
9 | 336038681052 |
10 | 106947062957 |
11 | 413a0913349 |
12 | 18888431525 |
13 | a114b6c497 |
14 | 526795b257 |
15 | 2bae0989c2 |
hex | 18e68aacad |
106947062957 has 16 divisors (see below), whose sum is σ = 128447882112. Its totient is φ = 87117145920.
The previous prime is 106947062939. The next prime is 106947062983. The reversal of 106947062957 is 759260749601.
It is not a de Polignac number, because 106947062957 - 28 = 106947062701 is a prime.
It is a super-2 number, since 2×1069470629572 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (56) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106941062957) 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, 4790294 + ... + 4812567.
It is an arithmetic number, because the mean of its divisors is an integer number (8027992632).
Almost surely, 2106947062957 is an apocalyptic number.
It is an amenable number.
106947062957 is a deficient number, since it is larger than the sum of its proper divisors (21500819155).
106947062957 is an equidigital number, since it uses as much as digits as its factorization.
106947062957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9602948.
The product of its (nonzero) digits is 5715360, while the sum is 56.
The spelling of 106947062957 in words is "one hundred six billion, nine hundred forty-seven million, sixty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •