Base | Representation |
---|---|
bin | 1001010011100101100101… |
… | …0110010000000000000001 |
3 | 1100020011212102020000221222 |
4 | 2110321121112100000001 |
5 | 2320120330420312001 |
6 | 33432322243324425 |
7 | 2104150152232313 |
oct | 224713126200001 |
9 | 40204772200858 |
10 | 10232111104001 |
11 | 3295460a709a6 |
12 | 1193075380715 |
13 | 592b65017847 |
14 | 275345b957b3 |
15 | 12b2624ed61b |
hex | 94e59590001 |
10232111104001 has 8 divisors (see below), whose sum is σ = 10274369474304. Its totient is φ = 10189912719520.
The previous prime is 10232111103997. The next prime is 10232111104009. The reversal of 10232111104001 is 10040111123201.
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 10232111104001 - 22 = 10232111103997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10232111104009) 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, 14654585 + ... + 15336918.
It is an arithmetic number, because the mean of its divisors is an integer number (1284296184288).
Almost surely, 210232111104001 is an apocalyptic number.
It is an amenable number.
10232111104001 is a deficient number, since it is larger than the sum of its proper divisors (42258370303).
10232111104001 is a wasteful number, since it uses less digits than its factorization.
10232111104001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29992911.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10232111104001 its reverse (10040111123201), we get a palindrome (20272222227202).
It can be divided in two parts, 1023211 and 1104001, that added together give a palindrome (2127212).
The spelling of 10232111104001 in words is "ten trillion, two hundred thirty-two billion, one hundred eleven million, one hundred four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •