Base | Representation |
---|---|
bin | 1100000110110111001100… |
… | …0001000111010000100110 |
3 | 1202010121200111020122121000 |
4 | 3001231303001013100212 |
5 | 3221101021012301042 |
6 | 44151244053334130 |
7 | 2542522411153401 |
oct | 301556301072046 |
9 | 52117614218530 |
10 | 13312033322022 |
11 | 4272668847a26 |
12 | 15abb65037346 |
13 | 75741c8178c6 |
14 | 34043d37ad38 |
15 | 18142349974c |
hex | c1b73047426 |
13312033322022 has 64 divisors (see below), whose sum is σ = 31139806118400. Its totient is φ = 4203726167520.
The previous prime is 13312033322011. The next prime is 13312033322053. The reversal of 13312033322022 is 22022333021331.
13312033322022 is a `hidden beast` number, since 1 + 3 + 3 + 120 + 3 + 332 + 202 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
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 31 ways as a sum of consecutive naturals, for example, 114269988 + ... + 114386424.
It is an arithmetic number, because the mean of its divisors is an integer number (486559470600).
Almost surely, 213312033322022 is an apocalyptic number.
13312033322022 is an abundant number, since it is smaller than the sum of its proper divisors (17827772796378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13312033322022 is a wasteful number, since it uses less digits than its factorization.
13312033322022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227898 (or 227892 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 13312033322022 its reverse (22022333021331), we get a palindrome (35334366343353).
The spelling of 13312033322022 in words is "thirteen trillion, three hundred twelve billion, thirty-three million, three hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •