Base | Representation |
---|---|
bin | 110001101010110110… |
… | …0110111100111100111 |
3 | 101012022122010020211200 |
4 | 1203111230313213213 |
5 | 3221422104234023 |
6 | 121000114533543 |
7 | 10464150332253 |
oct | 1432554674747 |
9 | 335278106750 |
10 | 106664524263 |
11 | 412663858a0 |
12 | 188098972b3 |
13 | a09b47641b |
14 | 523c211263 |
15 | 2b94388743 |
hex | 18d5b379e7 |
106664524263 has 24 divisors (see below), whose sum is σ = 169016440320. Its totient is φ = 64284009360.
The previous prime is 106664524249. The next prime is 106664524273. The reversal of 106664524263 is 362425466601.
It is a happy number.
It is not a de Polignac number, because 106664524263 - 25 = 106664524231 is a prime.
It is a super-2 number, since 2×1066645242632 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106664524273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2991831 + ... + 3027272.
It is an arithmetic number, because the mean of its divisors is an integer number (7042351680).
Almost surely, 2106664524263 is an apocalyptic number.
106664524263 is a deficient number, since it is larger than the sum of its proper divisors (62351916057).
106664524263 is a wasteful number, since it uses less digits than its factorization.
106664524263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6019299 (or 6019296 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 45.
The spelling of 106664524263 in words is "one hundred six billion, six hundred sixty-four million, five hundred twenty-four thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •