Base | Representation |
---|---|
bin | 11000011101000100001110… |
… | …00101111101000000000110 |
3 | 21001101212100010022012112211 |
4 | 30032202013011331000012 |
5 | 24022023211244440122 |
6 | 310212002333334034 |
7 | 14220063666622336 |
oct | 1416420705750006 |
9 | 231355303265484 |
10 | 53775257030662 |
11 | 16152a5a748472 |
12 | 604600893731a |
13 | 2400ca5cca88b |
14 | d3ca446a90c6 |
15 | 633c40345877 |
hex | 30e88717d006 |
53775257030662 has 16 divisors (see below), whose sum is σ = 82030350214800. Its totient is φ = 26431810260480.
The previous prime is 53775257030641. The next prime is 53775257030683. The reversal of 53775257030662 is 26603075257735.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (53775257030641) and next prime (53775257030683).
It is a super-2 number, since 2×537752570306622 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 53775257030597 and 53775257030606.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40711414 + ... + 42011542.
It is an arithmetic number, because the mean of its divisors is an integer number (5126896888425).
Almost surely, 253775257030662 is an apocalyptic number.
53775257030662 is a deficient number, since it is larger than the sum of its proper divisors (28255093184138).
53775257030662 is a wasteful number, since it uses less digits than its factorization.
53775257030662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1650711.
The product of its (nonzero) digits is 55566000, while the sum is 58.
The spelling of 53775257030662 in words is "fifty-three trillion, seven hundred seventy-five billion, two hundred fifty-seven million, thirty thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •