Base | Representation |
---|---|
bin | 100010001110110111010001… |
… | …1111010010101101011001100 |
3 | 1110111010211121011112212101220 |
4 | 1010131232203322111223030 |
5 | 303431341311140400022 |
6 | 2544224011244203340 |
7 | 120265324023500454 |
oct | 10435564372255314 |
9 | 1414124534485356 |
10 | 301110022200012 |
11 | 87a41052678743 |
12 | 29931181239550 |
13 | cc0272667114c |
14 | 544db34da0d64 |
15 | 24c286910585c |
hex | 111dba3e95acc |
301110022200012 has 12 divisors (see below), whose sum is σ = 702590051800056. Its totient is φ = 100370007400000.
The previous prime is 301110022199941. The next prime is 301110022200059. The reversal of 301110022200012 is 210002220011103.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 301110022199964 and 301110022200000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12546250924989 + ... + 12546250925012.
It is an arithmetic number, because the mean of its divisors is an integer number (58549170983338).
Almost surely, 2301110022200012 is an apocalyptic number.
It is an amenable number.
301110022200012 is an abundant number, since it is smaller than the sum of its proper divisors (401480029600044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301110022200012 is a wasteful number, since it uses less digits than its factorization.
301110022200012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25092501850008 (or 25092501850006 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 301110022200012 its reverse (210002220011103), we get a palindrome (511112242211115).
The spelling of 301110022200012 in words is "three hundred one trillion, one hundred ten billion, twenty-two million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •