Base | Representation |
---|---|
bin | 1110100110100111101101… |
… | …00011111110110000011011 |
3 | 11012201000001221022022221101 |
4 | 13103103312203332300123 |
5 | 13202121030401211443 |
6 | 152144352452252231 |
7 | 6523052545206505 |
oct | 723236643766033 |
9 | 135630057268841 |
10 | 32113312132123 |
11 | a2611a7562922 |
12 | 3727937311077 |
13 | 14bc37043c9c1 |
14 | 7d0414c76d75 |
15 | 3aa51aa4b84d |
hex | 1d34f68fec1b |
32113312132123 has 8 divisors (see below), whose sum is σ = 32185393396992. Its totient is φ = 32041311183336.
The previous prime is 32113312132091. The next prime is 32113312132129. The reversal of 32113312132123 is 32123121331123.
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 32113312132123 - 25 = 32113312132091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32113312132091 and 32113312132100.
It is not an unprimeable number, because it can be changed into a prime (32113312132129) 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, 19278415 + ... + 20877832.
It is an arithmetic number, because the mean of its divisors is an integer number (4023174174624).
Almost surely, 232113312132123 is an apocalyptic number.
32113312132123 is a deficient number, since it is larger than the sum of its proper divisors (72081264869).
32113312132123 is an equidigital number, since it uses as much as digits as its factorization.
32113312132123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40158041.
The product of its digits is 3888, while the sum is 28.
Adding to 32113312132123 its reverse (32123121331123), we get a palindrome (64236433463246).
The spelling of 32113312132123 in words is "thirty-two trillion, one hundred thirteen billion, three hundred twelve million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •