Base | Representation |
---|---|
bin | 101100011011011100011… |
… | …100000101100001010001 |
3 | 101210212122112120111221102 |
4 | 230123130130011201101 |
5 | 400010300013132241 |
6 | 10254330351234145 |
7 | 433403200262000 |
oct | 54333434054121 |
9 | 11725575514842 |
10 | 3053125130321 |
11 | a779065a5462 |
12 | 413871518955 |
13 | 191ba6b86266 |
14 | a7ab46c2c37 |
15 | 5464364839b |
hex | 2c6dc705851 |
3053125130321 has 8 divisors (see below), whose sum is σ = 3560495779200. Its totient is φ = 2616964397124.
The previous prime is 3053125130287. The next prime is 3053125130353. The reversal of 3053125130321 is 1230315213503.
It is a happy number.
It is not a de Polignac number, because 3053125130321 - 26 = 3053125130257 is a prime.
It is a super-2 number, since 2×30531251303212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3053125130381) by changing a digit.
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, 4450619381 + ... + 4450620066.
It is an arithmetic number, because the mean of its divisors is an integer number (445061972400).
Almost surely, 23053125130321 is an apocalyptic number.
It is an amenable number.
3053125130321 is a deficient number, since it is larger than the sum of its proper divisors (507370648879).
3053125130321 is an frugal number, since it uses more digits than its factorization.
3053125130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8901239468 (or 8901239454 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 29.
The spelling of 3053125130321 in words is "three trillion, fifty-three billion, one hundred twenty-five million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •