Base | Representation |
---|---|
bin | 1001001101110001110101… |
… | …1101110011011001010111 |
3 | 1022212122021221210122101222 |
4 | 2103130131131303121113 |
5 | 2312001443441000343 |
6 | 33314420301040555 |
7 | 2064015250456403 |
oct | 223343535633127 |
9 | 38778257718358 |
10 | 10132322203223 |
11 | 3257103809870 |
12 | 117786625615b |
13 | 58662117a3ac |
14 | 27059aba6103 |
15 | 128871ab1a68 |
hex | 9371d773657 |
10132322203223 has 8 divisors (see below), whose sum is σ = 11054479731600. Its totient is φ = 9210337562880.
The previous prime is 10132322203187. The next prime is 10132322203249. The reversal of 10132322203223 is 32230222323101.
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 10132322203223 - 216 = 10132322137687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10132322203192 and 10132322203201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10132322203723) 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, 43099448 + ... + 43333901.
It is an arithmetic number, because the mean of its divisors is an integer number (1381809966450).
Almost surely, 210132322203223 is an apocalyptic number.
10132322203223 is a deficient number, since it is larger than the sum of its proper divisors (922157528377).
10132322203223 is a wasteful number, since it uses less digits than its factorization.
10132322203223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86444017.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 10132322203223 its reverse (32230222323101), we get a palindrome (42362544526324).
The spelling of 10132322203223 in words is "ten trillion, one hundred thirty-two billion, three hundred twenty-two million, two hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •