Base | Representation |
---|---|
bin | 101100011011010110010… |
… | …000000110111111001110 |
3 | 101210212101022020202222110 |
4 | 230123112100012333032 |
5 | 400010041424433220 |
6 | 10254312202324450 |
7 | 433400500050213 |
oct | 54332620067716 |
9 | 11725338222873 |
10 | 3053021327310 |
11 | a77862a46749 |
12 | 4138427b9726 |
13 | 191b8b510766 |
14 | a7aa49c1b0a |
15 | 54639491be0 |
hex | 2c6d6406fce |
3053021327310 has 16 divisors (see below), whose sum is σ = 7327251185616. Its totient is φ = 814139020608.
The previous prime is 3053021327273. The next prime is 3053021327431. The reversal of 3053021327310 is 137231203503.
It is a super-2 number, since 2×30530213273102 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 101767377577 = 3053021327310 / (3 + 0 + 5 + 3 + 0 + 2 + 1 + 3 + 2 + 7 + 3 + 1 + 0).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50883688759 + ... + 50883688818.
It is an arithmetic number, because the mean of its divisors is an integer number (457953199101).
Almost surely, 23053021327310 is an apocalyptic number.
3053021327310 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3053021327310 is an abundant number, since it is smaller than the sum of its proper divisors (4274229858306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3053021327310 is a wasteful number, since it uses less digits than its factorization.
3053021327310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101767377587.
The product of its (nonzero) digits is 11340, while the sum is 30.
The spelling of 3053021327310 in words is "three trillion, fifty-three billion, twenty-one million, three hundred twenty-seven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •