Base | Representation |
---|---|
bin | 111101100100110100011… |
… | …110001101001010010111 |
3 | 112222112001011010021110200 |
4 | 331210310132031022113 |
5 | 1023311423304320043 |
6 | 12555520002351543 |
7 | 614465416034001 |
oct | 75446436151227 |
9 | 15875034107420 |
10 | 4231423120023 |
11 | 139159a046a50 |
12 | 5840b305b5b3 |
13 | 249038294a48 |
14 | 108b32879371 |
15 | 75107e687d3 |
hex | 3d93478d297 |
4231423120023 has 12 divisors (see below), whose sum is σ = 6667697037768. Its totient is φ = 2564498860560.
The previous prime is 4231423119881. The next prime is 4231423120039. The reversal of 4231423120023 is 3200213241324.
4231423120023 is a `hidden beast` number, since 4 + 2 + 31 + 423 + 1 + 200 + 2 + 3 = 666.
It is not a de Polignac number, because 4231423120023 - 241 = 2032399864471 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4231423020023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21370823740 + ... + 21370823937.
It is an arithmetic number, because the mean of its divisors is an integer number (555641419814).
Almost surely, 24231423120023 is an apocalyptic number.
4231423120023 is a deficient number, since it is larger than the sum of its proper divisors (2436273917745).
4231423120023 is a wasteful number, since it uses less digits than its factorization.
4231423120023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42741647694 (or 42741647691 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 4231423120023 its reverse (3200213241324), we get a palindrome (7431636361347).
The spelling of 4231423120023 in words is "four trillion, two hundred thirty-one billion, four hundred twenty-three million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •