Base | Representation |
---|---|
bin | 101101011011110111110… |
… | …000101101110111010110 |
3 | 102001111012122221102001200 |
4 | 231123313300231313112 |
5 | 402123434032000042 |
6 | 10350211033133330 |
7 | 441402402414213 |
oct | 55336760556726 |
9 | 12044178842050 |
10 | 3122303000022 |
11 | aa41857108a8 |
12 | 425158b5a246 |
13 | 19857cb9ca7b |
14 | ab19804cb0a |
15 | 563419aec4c |
hex | 2d6f7c2ddd6 |
3122303000022 has 48 divisors (see below), whose sum is σ = 6846805890288. Its totient is φ = 1028181718080.
The previous prime is 3122302999999. The next prime is 3122303000041. The reversal of 3122303000022 is 2200003032213.
It is a happy number.
3122303000022 is a `hidden beast` number, since 312 + 2 + 30 + 300 + 0 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 3122302999959 and 3122303000004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 52339372 + ... + 52398992.
It is an arithmetic number, because the mean of its divisors is an integer number (142641789381).
Almost surely, 23122303000022 is an apocalyptic number.
3122303000022 is an abundant number, since it is smaller than the sum of its proper divisors (3724502890266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3122303000022 is a wasteful number, since it uses less digits than its factorization.
3122303000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94765 (or 94762 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 3122303000022 its reverse (2200003032213), we get a palindrome (5322306032235).
The spelling of 3122303000022 in words is "three trillion, one hundred twenty-two billion, three hundred three million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •