Base | Representation |
---|---|
bin | 10100100000011… |
… | …10100011110110 |
3 | 102222200211110010 |
4 | 22100032203312 |
5 | 323014313402 |
6 | 25023041050 |
7 | 4156124553 |
oct | 1220164366 |
9 | 388624403 |
10 | 172026102 |
11 | 89116836 |
12 | 49740186 |
13 | 298415c1 |
14 | 18bbda2a |
15 | 10180a6c |
hex | a40e8f6 |
172026102 has 8 divisors (see below), whose sum is σ = 344052216. Its totient is φ = 57342032.
The previous prime is 172026097. The next prime is 172026109. The reversal of 172026102 is 201620271.
172026102 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
172026102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (172026109) 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 3 ways as a sum of consecutive naturals, for example, 14335503 + ... + 14335514.
It is an arithmetic number, because the mean of its divisors is an integer number (43006527).
Almost surely, 2172026102 is an apocalyptic number.
172026102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
172026102 is a wasteful number, since it uses less digits than its factorization.
172026102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28671022.
The product of its (nonzero) digits is 336, while the sum is 21.
The square root of 172026102 is about 13115.8721402734. The cubic root of 172026102 is about 556.1579072048.
Adding to 172026102 its reverse (201620271), we get a palindrome (373646373).
The spelling of 172026102 in words is "one hundred seventy-two million, twenty-six thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •