Base | Representation |
---|---|
bin | 1001011110101001100010… |
… | …1101100101100100111001 |
3 | 1100220100101202002210020012 |
4 | 2113222120231211210321 |
5 | 2331224032100403241 |
6 | 34055512035311305 |
7 | 2123655442445420 |
oct | 227523055454471 |
9 | 40810352083205 |
10 | 10422152747321 |
11 | 3359012580357 |
12 | 1203a71a4b535 |
13 | 5a7a6016a073 |
14 | 2806134742b7 |
15 | 13118658d6eb |
hex | 97a98b65939 |
10422152747321 has 8 divisors (see below), whose sum is σ = 11942964775104. Its totient is φ = 8909323985520.
The previous prime is 10422152747317. The next prime is 10422152747323. The reversal of 10422152747321 is 12374725122401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10422152747321 - 22 = 10422152747317 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10422152747323) by changing a digit.
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, 1995813695 + ... + 1995818916.
It is an arithmetic number, because the mean of its divisors is an integer number (1492870596888).
Almost surely, 210422152747321 is an apocalyptic number.
It is an amenable number.
10422152747321 is a deficient number, since it is larger than the sum of its proper divisors (1520812027783).
10422152747321 is an equidigital number, since it uses as much as digits as its factorization.
10422152747321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3991632991.
The product of its (nonzero) digits is 188160, while the sum is 41.
Adding to 10422152747321 its reverse (12374725122401), we get a palindrome (22796877869722).
The spelling of 10422152747321 in words is "ten trillion, four hundred twenty-two billion, one hundred fifty-two million, seven hundred forty-seven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •