Base | Representation |
---|---|
bin | 111101100111010110101… |
… | …010011011000000001001 |
3 | 112222210001210101001120202 |
4 | 331213112222123000021 |
5 | 1023333011410401213 |
6 | 13001050005301545 |
7 | 614623020065264 |
oct | 75472652330011 |
9 | 15883053331522 |
10 | 4234144231433 |
11 | 1392766042256 |
12 | 5847324048b5 |
13 | 24937cc6073c |
14 | 108d10005cdb |
15 | 75216cbdb58 |
hex | 3d9d6a9b009 |
4234144231433 has 2 divisors, whose sum is σ = 4234144231434. Its totient is φ = 4234144231432.
The previous prime is 4234144231411. The next prime is 4234144231477. The reversal of 4234144231433 is 3341324414324.
4234144231433 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4152249817849 + 81894413584 = 2037707^2 + 286172^2 .
It is a cyclic number.
It is not a de Polignac number, because 4234144231433 - 222 = 4234140037129 is a prime.
It is not a weakly prime, because it can be changed into another prime (4234144231483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2117072115716 + 2117072115717.
It is an arithmetic number, because the mean of its divisors is an integer number (2117072115717).
Almost surely, 24234144231433 is an apocalyptic number.
It is an amenable number.
4234144231433 is a deficient number, since it is larger than the sum of its proper divisors (1).
4234144231433 is an equidigital number, since it uses as much as digits as its factorization.
4234144231433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 331776, while the sum is 38.
Adding to 4234144231433 its reverse (3341324414324), we get a palindrome (7575468645757).
The spelling of 4234144231433 in words is "four trillion, two hundred thirty-four billion, one hundred forty-four million, two hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •