Base | Representation |
---|---|
bin | 11101101101000100000… |
… | …00101110110110100101 |
3 | 10121120102010122202201212 |
4 | 32312202000232312211 |
5 | 113210220042200203 |
6 | 2100511355201205 |
7 | 133511022222641 |
oct | 16664200566645 |
9 | 3546363582655 |
10 | 1020625350053 |
11 | 363932447741 |
12 | 145979446205 |
13 | 753243a669a |
14 | 375817d3c21 |
15 | 1b83735b1d8 |
hex | eda202eda5 |
1020625350053 has 8 divisors (see below), whose sum is σ = 1074352204800. Its totient is φ = 966899468448.
The previous prime is 1020625349983. The next prime is 1020625350103. The reversal of 1020625350053 is 3500535260201.
1020625350053 is digitally balanced in base 2, 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.
It is a cyclic number.
It is not a de Polignac number, because 1020625350053 - 216 = 1020625284517 is a prime.
It is a super-2 number, since 2×10206253500532 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025625350053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3058913 + ... + 3376121.
It is an arithmetic number, because the mean of its divisors is an integer number (134294025600).
Almost surely, 21020625350053 is an apocalyptic number.
It is an amenable number.
1020625350053 is a deficient number, since it is larger than the sum of its proper divisors (53726854747).
1020625350053 is a wasteful number, since it uses less digits than its factorization.
1020625350053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 486571.
The product of its (nonzero) digits is 27000, while the sum is 32.
The spelling of 1020625350053 in words is "one trillion, twenty billion, six hundred twenty-five million, three hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •