Base | Representation |
---|---|
bin | 1110100110100011101001… |
… | …00001000000000110100011 |
3 | 11012200210102212211102221021 |
4 | 13103101310201000012203 |
5 | 13202102043330004443 |
6 | 152143352152310311 |
7 | 6522644513102251 |
oct | 723216441000643 |
9 | 135623385742837 |
10 | 32111130313123 |
11 | a260287a20a24 |
12 | 37274286a2397 |
13 | 14bc0b3405844 |
14 | 7d02891ad5d1 |
15 | 3aa43e2219ed |
hex | 1d34748401a3 |
32111130313123 has 8 divisors (see below), whose sum is σ = 34006887724320. Its totient is φ = 30216135945600.
The previous prime is 32111130313103. The next prime is 32111130313127. The reversal of 32111130313123 is 32131303111123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32111130313123 is a prime.
It is a super-2 number, since 2×321111303131232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32111130313127) 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, 190674268 + ... + 190842601.
It is an arithmetic number, because the mean of its divisors is an integer number (4250860965540).
Almost surely, 232111130313123 is an apocalyptic number.
32111130313123 is a deficient number, since it is larger than the sum of its proper divisors (1895757411197).
32111130313123 is a wasteful number, since it uses less digits than its factorization.
32111130313123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 381521837.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 32111130313123 its reverse (32131303111123), we get a palindrome (64242433424246).
The spelling of 32111130313123 in words is "thirty-two trillion, one hundred eleven billion, one hundred thirty million, three hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •