Base | Representation |
---|---|
bin | 1110100110110100001101… |
… | …11111000010100100010111 |
3 | 11012201122102010101001212202 |
4 | 13103122012333002210113 |
5 | 13202223310202041043 |
6 | 152151423234035115 |
7 | 6523411201122650 |
oct | 723320677024427 |
9 | 135648363331782 |
10 | 32120030112023 |
11 | a2640346a3627 |
12 | 37290b1118a9b |
13 | 14bcba11a1939 |
14 | 7d0891180527 |
15 | 3aa7b07091b8 |
hex | 1d3686fc2917 |
32120030112023 has 4 divisors (see below), whose sum is σ = 36708605842320. Its totient is φ = 27531454381728.
The previous prime is 32120030112013. The next prime is 32120030112031. The reversal of 32120030112023 is 32021103002123.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 32120030112023 - 210 = 32120030110999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32120030111986 and 32120030112004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32120030112013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2294287865138 + ... + 2294287865151.
It is an arithmetic number, because the mean of its divisors is an integer number (9177151460580).
Almost surely, 232120030112023 is an apocalyptic number.
32120030112023 is a deficient number, since it is larger than the sum of its proper divisors (4588575730297).
32120030112023 is an equidigital number, since it uses as much as digits as its factorization.
32120030112023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4588575730296.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 32120030112023 its reverse (32021103002123), we get a palindrome (64141133114146).
The spelling of 32120030112023 in words is "thirty-two trillion, one hundred twenty billion, thirty million, one hundred twelve thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •