Base | Representation |
---|---|
bin | 100000010100000011000100… |
… | …1110100101010101110101101 |
3 | 1101021101011020200212022221221 |
4 | 1000220012021310222232231 |
5 | 244223312240414014433 |
6 | 2444301343131223341 |
7 | 113603652235061023 |
oct | 10050061164525655 |
9 | 1337334220768857 |
10 | 284230363032493 |
11 | 82623469074a39 |
12 | 27a658b95a7b51 |
13 | c279a6789abb7 |
14 | 5028b74344713 |
15 | 22cd73d84172d |
hex | 1028189d2abad |
284230363032493 has 2 divisors, whose sum is σ = 284230363032494. Its totient is φ = 284230363032492.
The previous prime is 284230363032467. The next prime is 284230363032521. The reversal of 284230363032493 is 394230363032482.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 200059610043049 + 84170752989444 = 14144243^2 + 9174462^2 .
It is a cyclic number.
It is not a de Polignac number, because 284230363032493 - 25 = 284230363032461 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 284230363032493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (284230363032443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 142115181516246 + 142115181516247.
It is an arithmetic number, because the mean of its divisors is an integer number (142115181516247).
Almost surely, 2284230363032493 is an apocalyptic number.
It is an amenable number.
284230363032493 is a deficient number, since it is larger than the sum of its proper divisors (1).
284230363032493 is an equidigital number, since it uses as much as digits as its factorization.
284230363032493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13436928, while the sum is 52.
The spelling of 284230363032493 in words is "two hundred eighty-four trillion, two hundred thirty billion, three hundred sixty-three million, thirty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •