Base | Representation |
---|---|
bin | 1110100110100001100101… |
… | …11100011100001111011101 |
3 | 11012200200121012210102011122 |
4 | 13103100302330130033131 |
5 | 13202042320213210023 |
6 | 152143051053300325 |
7 | 6522605324266460 |
oct | 723206274341735 |
9 | 135620535712148 |
10 | 32110030210013 |
11 | a25a872a461a8 |
12 | 37271801946a5 |
13 | 14bbc69519c62 |
14 | 7d01c30452d7 |
15 | 3aa3c786a2c8 |
hex | 1d3432f1c3dd |
32110030210013 has 8 divisors (see below), whose sum is σ = 37244896448832. Its totient is φ = 27112093737696.
The previous prime is 32110030209989. The next prime is 32110030210081. The reversal of 32110030210013 is 31001203001123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-32110030210013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32110030209973 and 32110030210000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32110030210213) 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, 34232441120 + ... + 34232442057.
It is an arithmetic number, because the mean of its divisors is an integer number (4655612056104).
Almost surely, 232110030210013 is an apocalyptic number.
It is an amenable number.
32110030210013 is a deficient number, since it is larger than the sum of its proper divisors (5134866238819).
32110030210013 is an equidigital number, since it uses as much as digits as its factorization.
32110030210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68464883251.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 32110030210013 its reverse (31001203001123), we get a palindrome (63111233211136).
The spelling of 32110030210013 in words is "thirty-two trillion, one hundred ten billion, thirty million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •