Base | Representation |
---|---|
bin | 1011111011110100000101… |
… | …1001101001100110100010 |
3 | 1201110110202020101022121110 |
4 | 2332331001121221212202 |
5 | 3204443302404113242 |
6 | 43524133221204150 |
7 | 2523022621314645 |
oct | 276750131514642 |
9 | 51413666338543 |
10 | 13122222332322 |
11 | 41aa115457aa4 |
12 | 157b211860656 |
13 | 7425603c300c |
14 | 33519457da5c |
15 | 17b5147bb39c |
hex | bef416699a2 |
13122222332322 has 16 divisors (see below), whose sum is σ = 26246923254720. Its totient is φ = 4373661012432.
The previous prime is 13122222332309. The next prime is 13122222332399. The reversal of 13122222332322 is 22323322222131.
It is a happy number.
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 13122222332322.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103205758 + ... + 103332825.
It is an arithmetic number, because the mean of its divisors is an integer number (1640432703420).
Almost surely, 213122222332322 is an apocalyptic number.
13122222332322 is an abundant number, since it is smaller than the sum of its proper divisors (13124700922398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13122222332322 is a wasteful number, since it uses less digits than its factorization.
13122222332322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206549177.
The product of its digits is 20736, while the sum is 30.
Adding to 13122222332322 its reverse (22323322222131), we get a palindrome (35445544554453).
The spelling of 13122222332322 in words is "thirteen trillion, one hundred twenty-two billion, two hundred twenty-two million, three hundred thirty-two thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •