Base | Representation |
---|---|
bin | 111010100010000011111… |
… | …001010010111110100101 |
3 | 112020112021011021002012022 |
4 | 322202003321102332211 |
5 | 1011400133332134133 |
6 | 12315453052032525 |
7 | 563413253534153 |
oct | 72420371227645 |
9 | 15215234232168 |
10 | 4022302224293 |
11 | 13109378208a1 |
12 | 54b670a62745 |
13 | 2323bc446a62 |
14 | dc9752b23d3 |
15 | 6e968dd6998 |
hex | 3a883e52fa5 |
4022302224293 has 2 divisors, whose sum is σ = 4022302224294. Its totient is φ = 4022302224292.
The previous prime is 4022302224263. The next prime is 4022302224301. The reversal of 4022302224293 is 3924222032204.
4022302224293 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4022298991489 + 3232804 = 2005567^2 + 1798^2 .
It is a cyclic number.
It is not a de Polignac number, because 4022302224293 - 26 = 4022302224229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4022302224203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011151112146 + 2011151112147.
It is an arithmetic number, because the mean of its divisors is an integer number (2011151112147).
Almost surely, 24022302224293 is an apocalyptic number.
It is an amenable number.
4022302224293 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022302224293 is an equidigital number, since it uses as much as digits as its factorization.
4022302224293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 4022302224293 its reverse (3924222032204), we get a palindrome (7946524256497).
The spelling of 4022302224293 in words is "four trillion, twenty-two billion, three hundred two million, two hundred twenty-four thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •