Base | Representation |
---|---|
bin | 101011111100101100110… |
… | …000110110011001001101 |
3 | 101200201102212110011102122 |
4 | 223330230300312121031 |
5 | 343440142412343201 |
6 | 10231230515102325 |
7 | 431124134016650 |
oct | 53745460663115 |
9 | 11621385404378 |
10 | 3020113012301 |
11 | a649060745a0 |
12 | 4093998a19a5 |
13 | 18ba45756008 |
14 | a62621d9897 |
15 | 53860384e1b |
hex | 2bf2cc3664d |
3020113012301 has 32 divisors (see below), whose sum is σ = 3770005006080. Its totient is φ = 2350418112000.
The previous prime is 3020113012253. The next prime is 3020113012313. The reversal of 3020113012301 is 1032103110203.
It is not a de Polignac number, because 3020113012301 - 26 = 3020113012237 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3020113012301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3020113012321) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 382240451 + ... + 382248351.
It is an arithmetic number, because the mean of its divisors is an integer number (117812656440).
Almost surely, 23020113012301 is an apocalyptic number.
It is an amenable number.
3020113012301 is a deficient number, since it is larger than the sum of its proper divisors (749891993779).
3020113012301 is a wasteful number, since it uses less digits than its factorization.
3020113012301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13445.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3020113012301 its reverse (1032103110203), we get a palindrome (4052216122504).
The spelling of 3020113012301 in words is "three trillion, twenty billion, one hundred thirteen million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.204 sec. • engine limits •