Base | Representation |
---|---|
bin | 111010100010110100101… |
… | …010011110100111001101 |
3 | 112020121101011211220022221 |
4 | 322202310222132213031 |
5 | 1011403322312021443 |
6 | 12320110200535341 |
7 | 563442450236212 |
oct | 72426452364715 |
9 | 15217334756287 |
10 | 4023120423373 |
11 | 1311217661987 |
12 | 54b85aa81551 |
13 | 2324bcacc41c |
14 | dca11c17b09 |
15 | 6e9b5b55eed |
hex | 3a8b4a9e9cd |
4023120423373 has 2 divisors, whose sum is σ = 4023120423374. Its totient is φ = 4023120423372.
The previous prime is 4023120423317. The next prime is 4023120423419. The reversal of 4023120423373 is 3733240213204.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3844430761284 + 178689662089 = 1960722^2 + 422717^2 .
It is a cyclic number.
It is not a de Polignac number, because 4023120423373 - 29 = 4023120422861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4023120420373) 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 as a sum of consecutive naturals, namely, 2011560211686 + 2011560211687.
It is an arithmetic number, because the mean of its divisors is an integer number (2011560211687).
Almost surely, 24023120423373 is an apocalyptic number.
It is an amenable number.
4023120423373 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023120423373 is an equidigital number, since it uses as much as digits as its factorization.
4023120423373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 34.
Adding to 4023120423373 its reverse (3733240213204), we get a palindrome (7756360636577).
The spelling of 4023120423373 in words is "four trillion, twenty-three billion, one hundred twenty million, four hundred twenty-three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •