Base | Representation |
---|---|
bin | 101011101010110000000001… |
… | …010111111001010100111000 |
3 | 221012000011101012000201011002 |
4 | 223222300001113321110320 |
5 | 200133102120321234042 |
6 | 1520244142215224132 |
7 | 55311266502264143 |
oct | 5352600127712470 |
9 | 835004335021132 |
10 | 192053780649272 |
11 | 562156073879a3 |
12 | 19659386678048 |
13 | 8321794788119 |
14 | 355d649c4b05a |
15 | 1730b5d866132 |
hex | aeac015f9538 |
192053780649272 has 16 divisors (see below), whose sum is σ = 360101178049200. Its totient is φ = 96026799836160.
The previous prime is 192053780649259. The next prime is 192053780649299. The reversal of 192053780649272 is 272946087350291.
It is a junction number, because it is equal to n+sod(n) for n = 192053780649199 and 192053780649208.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1822604 + ... + 19683227.
It is an arithmetic number, because the mean of its divisors is an integer number (22506323628075).
It is a 2-persistent number, because it is pandigital, and so is 2⋅192053780649272 = 384107561298544, but 3⋅192053780649272 = 576161341947816 is not.
Almost surely, 2192053780649272 is an apocalyptic number.
It is an amenable number.
192053780649272 is a deficient number, since it is larger than the sum of its proper divisors (168047397399928).
192053780649272 is a wasteful number, since it uses less digits than its factorization.
192053780649272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22622126 (or 22622122 counting only the distinct ones).
The product of its (nonzero) digits is 91445760, while the sum is 65.
The spelling of 192053780649272 in words is "one hundred ninety-two trillion, fifty-three billion, seven hundred eighty million, six hundred forty-nine thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •