Base | Representation |
---|---|
bin | 101011110101001001001… |
… | …100100101101011010000 |
3 | 101122221111110121002111020 |
4 | 223311021030211223100 |
5 | 343322034012030222 |
6 | 10223405503315440 |
7 | 430416112343253 |
oct | 53651114455320 |
9 | 11587443532436 |
10 | 3012000111312 |
11 | a614225a3a45 |
12 | 4078b48abb80 |
13 | 18b051a0329a |
14 | a5ad294309a |
15 | 53537ed765c |
hex | 2bd49325ad0 |
3012000111312 has 80 divisors (see below), whose sum is σ = 8672322346560. Its totient is φ = 895207458816.
The previous prime is 3012000111277. The next prime is 3012000111319. The reversal of 3012000111312 is 2131110002103.
It is a happy number.
It is a super-2 number, since 2×30120001113122 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3012000111291 and 3012000111300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012000111319) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97120723 + ... + 97151730.
It is an arithmetic number, because the mean of its divisors is an integer number (108404029332).
Almost surely, 23012000111312 is an apocalyptic number.
It is an amenable number.
3012000111312 is an abundant number, since it is smaller than the sum of its proper divisors (5660322235248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3012000111312 is a wasteful number, since it uses less digits than its factorization.
3012000111312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194272500 (or 194272494 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 3012000111312 its reverse (2131110002103), we get a palindrome (5143110113415).
The spelling of 3012000111312 in words is "three trillion, twelve billion, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •