Base | Representation |
---|---|
bin | 1011111011110100000011… |
… | …0010101010101110101010 |
3 | 1201110110201112011010202222 |
4 | 2332331000302222232222 |
5 | 3204443242300111242 |
6 | 43524132214154042 |
7 | 2523022435413644 |
oct | 276750062525652 |
9 | 51413645133688 |
10 | 13122212113322 |
11 | 41aa10a708344 |
12 | 157b20a352922 |
13 | 74255b255880 |
14 | 33519307d894 |
15 | 17b51394d5d2 |
hex | bef40caabaa |
13122212113322 has 8 divisors (see below), whose sum is σ = 21197419567716. Its totient is φ = 6056405590752.
The previous prime is 13122212113261. The next prime is 13122212113331. The reversal of 13122212113322 is 22331121222131.
It can be written as a sum of positive squares in 2 ways, for example, as 11475555978481 + 1646656134841 = 3387559^2 + 1283221^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 504700465897 = 13122212113322 / (1 + 3 + 1 + 2 + 2 + 2 + 1 + 2 + 1 + 1 + 3 + 3 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 13122212113291 and 13122212113300.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 252350232923 + ... + 252350232974.
Almost surely, 213122212113322 is an apocalyptic number.
13122212113322 is a deficient number, since it is larger than the sum of its proper divisors (8075207454394).
13122212113322 is a wasteful number, since it uses less digits than its factorization.
13122212113322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 504700465912.
The product of its digits is 1728, while the sum is 26.
Adding to 13122212113322 its reverse (22331121222131), we get a palindrome (35453333335453).
The spelling of 13122212113322 in words is "thirteen trillion, one hundred twenty-two billion, two hundred twelve million, one hundred thirteen thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •