Base | Representation |
---|---|
bin | 1011000001101000101010… |
… | …0101000011010010111100 |
3 | 1120220220212101110002021220 |
4 | 2300122022211003102330 |
5 | 3042104314001143243 |
6 | 41441034002553340 |
7 | 2360560240402341 |
oct | 260321245032274 |
9 | 46826771402256 |
10 | 12122722677948 |
11 | 3954243a05193 |
12 | 143956b368850 |
13 | 69c2249a099c |
14 | 2dca5877c7c8 |
15 | 160516e3a783 |
hex | b068a9434bc |
12122722677948 has 12 divisors (see below), whose sum is σ = 28286352915240. Its totient is φ = 4040907559312.
The previous prime is 12122722677911. The next prime is 12122722677971. The reversal of 12122722677948 is 84977622722121.
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 = 12122722677891 and 12122722677900.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 505113444903 + ... + 505113444926.
It is an arithmetic number, because the mean of its divisors is an integer number (2357196076270).
Almost surely, 212122722677948 is an apocalyptic number.
It is an amenable number.
12122722677948 is an abundant number, since it is smaller than the sum of its proper divisors (16163630237292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12122722677948 is a wasteful number, since it uses less digits than its factorization.
12122722677948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010226889836 (or 1010226889834 counting only the distinct ones).
The product of its digits is 18966528, while the sum is 60.
The spelling of 12122722677948 in words is "twelve trillion, one hundred twenty-two billion, seven hundred twenty-two million, six hundred seventy-seven thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •