Base | Representation |
---|---|
bin | 10011010000001111101… |
… | …100010011101010111001 |
3 | 11200111012000220200110012 |
4 | 103100033230103222321 |
5 | 133134213434402223 |
6 | 2451455123431305 |
7 | 164406656432132 |
oct | 23201754235271 |
9 | 4614160820405 |
10 | 1323113200313 |
11 | 4701469a9733 |
12 | 194517b25535 |
13 | 979cc76c528 |
14 | 48079102c89 |
15 | 2463d145c78 |
hex | 1340fb13ab9 |
1323113200313 has 8 divisors (see below), whose sum is σ = 1352577022536. Its totient is φ = 1293900134400.
The previous prime is 1323113200303. The next prime is 1323113200319. The reversal of 1323113200313 is 3130023113231.
It can be written as a sum of positive squares in 4 ways, for example, as 475614363904 + 847498836409 = 689648^2 + 920597^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 1323113200313 - 26 = 1323113200249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1323113200319) 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, 62678408 + ... + 62699513.
It is an arithmetic number, because the mean of its divisors is an integer number (169072127817).
Almost surely, 21323113200313 is an apocalyptic number.
It is an amenable number.
1323113200313 is a deficient number, since it is larger than the sum of its proper divisors (29463822223).
1323113200313 is a wasteful number, since it uses less digits than its factorization.
1323113200313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125378155.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1323113200313 its reverse (3130023113231), we get a palindrome (4453136313544).
The spelling of 1323113200313 in words is "one trillion, three hundred twenty-three billion, one hundred thirteen million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •