Base | Representation |
---|---|
bin | 1110100111001001001110… |
… | …11101100011101101011011 |
3 | 11012202201112101222202010110 |
4 | 13103210213131203231123 |
5 | 13202414411433314433 |
6 | 152200530544415403 |
7 | 6524260606032306 |
oct | 723444735435533 |
9 | 135681471882113 |
10 | 32131312401243 |
11 | a2688a42094a0 |
12 | 372b31b617563 |
13 | 14c0c7b735913 |
14 | 7d1241733b3d |
15 | 3aac20e59963 |
hex | 1d3927763b5b |
32131312401243 has 16 divisors (see below), whose sum is σ = 46930381610112. Its totient is φ = 19392719664000.
The previous prime is 32131312401143. The next prime is 32131312401247. The reversal of 32131312401243 is 34210421313123.
It is not a de Polignac number, because 32131312401243 - 220 = 32131311352667 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32131312401243.
It is not an unprimeable number, because it can be changed into a prime (32131312401247) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2020067013 + ... + 2020082918.
It is an arithmetic number, because the mean of its divisors is an integer number (2933148850632).
Almost surely, 232131312401243 is an apocalyptic number.
32131312401243 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
32131312401243 is a deficient number, since it is larger than the sum of its proper divisors (14799069208869).
32131312401243 is a wasteful number, since it uses less digits than its factorization.
32131312401243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4040150186.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 32131312401243 its reverse (34210421313123), we get a palindrome (66341733714366).
The spelling of 32131312401243 in words is "thirty-two trillion, one hundred thirty-one billion, three hundred twelve million, four hundred one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •