Base | Representation |
---|---|
bin | 1110100110110100100101… |
… | …11001100110010011001111 |
3 | 11012201122221001112001020201 |
4 | 13103122102321212103033 |
5 | 13202224212340341421 |
6 | 152151455134354331 |
7 | 6523416146213023 |
oct | 723322271462317 |
9 | 135648831461221 |
10 | 32120230012111 |
11 | a26412751850a |
12 | 372914805b9a7 |
13 | 14bcc03722607 |
14 | 7d08ad938383 |
15 | 3aa7c3043b91 |
hex | 1d3692e664cf |
32120230012111 has 8 divisors (see below), whose sum is σ = 33517529476704. Its totient is φ = 30722994524640.
The previous prime is 32120230012081. The next prime is 32120230012181. The reversal of 32120230012111 is 11121003202123.
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 32120230012111 - 27 = 32120230011983 is a prime.
It is a super-2 number, since 2×321202300121112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32120230012181) 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, 14966920 + ... + 16977901.
It is an arithmetic number, because the mean of its divisors is an integer number (4189691184588).
Almost surely, 232120230012111 is an apocalyptic number.
32120230012111 is a deficient number, since it is larger than the sum of its proper divisors (1397299464593).
32120230012111 is a wasteful number, since it uses less digits than its factorization.
32120230012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31988561.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 32120230012111 its reverse (11121003202123), we get a palindrome (43241233214234).
The spelling of 32120230012111 in words is "thirty-two trillion, one hundred twenty billion, two hundred thirty million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •