Base | Representation |
---|---|
bin | 110001101100010001… |
… | …0100011001001111111 |
3 | 101012102221201220222010 |
4 | 1203120202203021333 |
5 | 3222021302310110 |
6 | 121004535422303 |
7 | 10465266212565 |
oct | 1433042431177 |
9 | 335387656863 |
10 | 106712150655 |
11 | 41290255250 |
12 | 18821824993 |
13 | a0a82b0316 |
14 | 524468ba35 |
15 | 2b98645020 |
hex | 18d88a327f |
106712150655 has 32 divisors (see below), whose sum is σ = 186571300608. Its totient is φ = 51653088000.
The previous prime is 106712150557. The next prime is 106712150663. The reversal of 106712150655 is 556051217601.
It is a happy number.
It is not a de Polignac number, because 106712150655 - 27 = 106712150527 is a prime.
It is a super-2 number, since 2×1067121506552 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 438889 + ... + 637218.
It is an arithmetic number, because the mean of its divisors is an integer number (5830353144).
Almost surely, 2106712150655 is an apocalyptic number.
106712150655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
106712150655 is a deficient number, since it is larger than the sum of its proper divisors (79859149953).
106712150655 is a wasteful number, since it uses less digits than its factorization.
106712150655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1076727.
The product of its (nonzero) digits is 63000, while the sum is 39.
The spelling of 106712150655 in words is "one hundred six billion, seven hundred twelve million, one hundred fifty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •