Base | Representation |
---|---|
bin | 1010000001000011101… |
… | …1011110100110000110 |
3 | 121110011201222212122010 |
4 | 2200100323132212012 |
5 | 10304411134002420 |
6 | 211015333515050 |
7 | 15301240656351 |
oct | 2402073364606 |
9 | 543151885563 |
10 | 172082719110 |
11 | 66a86232935 |
12 | 294261a2a86 |
13 | 132c55a4363 |
14 | 8486505298 |
15 | 47225ec4e0 |
hex | 2810ede986 |
172082719110 has 16 divisors (see below), whose sum is σ = 412998525936. Its totient is φ = 45888725088.
The previous prime is 172082719091. The next prime is 172082719111. The reversal of 172082719110 is 11917280271.
It is a super-2 number, since 2×1720827191102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (172082719111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2868045289 + ... + 2868045348.
It is an arithmetic number, because the mean of its divisors is an integer number (25812407871).
Almost surely, 2172082719110 is an apocalyptic number.
172082719110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
172082719110 is an abundant number, since it is smaller than the sum of its proper divisors (240915806826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
172082719110 is a wasteful number, since it uses less digits than its factorization.
172082719110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5736090647.
The product of its (nonzero) digits is 14112, while the sum is 39.
Adding to 172082719110 its reverse (11917280271), we get a palindrome (183999999381).
The spelling of 172082719110 in words is "one hundred seventy-two billion, eighty-two million, seven hundred nineteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •