Base | Representation |
---|---|
bin | 1100101100100… |
… | …01011110100100 |
3 | 21102101212100110 |
4 | 12112101132210 |
5 | 204231031202 |
6 | 14322413020 |
7 | 2432152416 |
oct | 626213644 |
9 | 242355313 |
10 | 106502052 |
11 | 55132628 |
12 | 2b801170 |
13 | 190ac187 |
14 | 102049b6 |
15 | 953b26c |
hex | 65917a4 |
106502052 has 24 divisors (see below), whose sum is σ = 259310016. Its totient is φ = 33957088.
The previous prime is 106502041. The next prime is 106502057. The reversal of 106502052 is 250205601.
It is a super-2 number, since 2×1065020522 = 22685374160421408, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106502057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192663 + ... + 193214.
It is an arithmetic number, because the mean of its divisors is an integer number (10804584).
Almost surely, 2106502052 is an apocalyptic number.
106502052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106502052 is an abundant number, since it is smaller than the sum of its proper divisors (152807964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106502052 is a wasteful number, since it uses less digits than its factorization.
106502052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385907 (or 385905 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 106502052 is about 10319.9831395211. The cubic root of 106502052 is about 474.0083496544.
Adding to 106502052 its reverse (250205601), we get a palindrome (356707653).
The spelling of 106502052 in words is "one hundred six million, five hundred two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •