Base | Representation |
---|---|
bin | 10011010000010110101… |
… | …101110010101101010101 |
3 | 11200111111020122001112102 |
4 | 103100112231302231111 |
5 | 133134434120430401 |
6 | 2451514533131445 |
7 | 164412620114201 |
oct | 23202655625525 |
9 | 4614436561472 |
10 | 1323231030101 |
11 | 4701a7468a22 |
12 | 19454b489b85 |
13 | 97a1acb66b6 |
14 | 4808aa15b01 |
15 | 2464866d56b |
hex | 13416b72b55 |
1323231030101 has 8 divisors (see below), whose sum is σ = 1327249037400. Its totient is φ = 1319213564928.
The previous prime is 1323231030019. The next prime is 1323231030139. The reversal of 1323231030101 is 1010301323231.
It can be written as a sum of positive squares in 4 ways, for example, as 954527046001 + 368703984100 = 976999^2 + 607210^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1323231030101 - 214 = 1323231013717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323231039101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5054375 + ... + 5309723.
It is an arithmetic number, because the mean of its divisors is an integer number (165906129675).
Almost surely, 21323231030101 is an apocalyptic number.
It is an amenable number.
1323231030101 is a deficient number, since it is larger than the sum of its proper divisors (4018007299).
1323231030101 is a wasteful number, since it uses less digits than its factorization.
1323231030101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271063.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1323231030101 its reverse (1010301323231), we get a palindrome (2333532353332).
The spelling of 1323231030101 in words is "one trillion, three hundred twenty-three billion, two hundred thirty-one million, thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •