Base | Representation |
---|---|
bin | 1011001101110101000001… |
… | …1010000000010111001010 |
3 | 1121122221120020011202112211 |
4 | 2303131100122000113022 |
5 | 3104022321211220242 |
6 | 42121200131055334 |
7 | 2411654262204313 |
oct | 263352032002712 |
9 | 47587506152484 |
10 | 12332200101322 |
11 | 3a25069503892 |
12 | 1472090a4154a |
13 | 6b5bc964c08a |
14 | 308c4b43160a |
15 | 165bc7445317 |
hex | b37506805ca |
12332200101322 has 4 divisors (see below), whose sum is σ = 18498300151986. Its totient is φ = 6166100050660.
The previous prime is 12332200101289. The next prime is 12332200101337. The reversal of 12332200101322 is 22310100223321.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 8444958052441 + 3887242048881 = 2906021^2 + 1971609^2 .
It is a super-2 number, since 2×123322001013222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12332200101293 and 12332200101302.
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 as a sum of consecutive naturals, namely, 3083050025329 + ... + 3083050025332.
Almost surely, 212332200101322 is an apocalyptic number.
12332200101322 is a deficient number, since it is larger than the sum of its proper divisors (6166100050664).
12332200101322 is an equidigital number, since it uses as much as digits as its factorization.
12332200101322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6166100050663.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12332200101322 its reverse (22310100223321), we get a palindrome (34642300324643).
The spelling of 12332200101322 in words is "twelve trillion, three hundred thirty-two billion, two hundred million, one hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •