Base | Representation |
---|---|
bin | 110000000111011010111101… |
… | …0110001111101101010110101 |
3 | 2001111112121212220020201202010 |
4 | 1200032311322301331222311 |
5 | 420433220010122430031 |
6 | 4100050143434034433 |
7 | 155101351134420036 |
oct | 14016657261755265 |
9 | 2044477786221663 |
10 | 423232432233141 |
11 | 112944959392373 |
12 | 3b575345278a19 |
13 | 15220854908b3b |
14 | 76727b7d38a8d |
15 | 33de3a8098246 |
hex | 180ed7ac7dab5 |
423232432233141 has 16 divisors (see below), whose sum is σ = 574436555622720. Its totient is φ = 277100999687040.
The previous prime is 423232432233137. The next prime is 423232432233151. The reversal of 423232432233141 is 141332234232324.
It is not a de Polignac number, because 423232432233141 - 22 = 423232432233137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 423232432233141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (423232432233151) 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, 1170800520 + ... + 1171161953.
It is an arithmetic number, because the mean of its divisors is an integer number (35902284726420).
Almost surely, 2423232432233141 is an apocalyptic number.
It is an amenable number.
423232432233141 is a deficient number, since it is larger than the sum of its proper divisors (151204123389579).
423232432233141 is a wasteful number, since it uses less digits than its factorization.
423232432233141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2341963556.
The product of its digits is 497664, while the sum is 39.
Adding to 423232432233141 its reverse (141332234232324), we get a palindrome (564564666465465).
The spelling of 423232432233141 in words is "four hundred twenty-three trillion, two hundred thirty-two billion, four hundred thirty-two million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •