Base | Representation |
---|---|
bin | 111101011101010010101… |
… | …111011001101010111101 |
3 | 112221202011220012112020111 |
4 | 331131102233121222331 |
5 | 1023143400244301342 |
6 | 12552102010550021 |
7 | 614061220160563 |
oct | 75352257315275 |
9 | 15852156175214 |
10 | 4223341009597 |
11 | 1389121996846 |
12 | 582618438311 |
13 | 24834aa32a98 |
14 | 1085a7319a33 |
15 | 74cd364e217 |
hex | 3d752bd9abd |
4223341009597 has 2 divisors, whose sum is σ = 4223341009598. Its totient is φ = 4223341009596.
The previous prime is 4223341009577. The next prime is 4223341009637. The reversal of 4223341009597 is 7959001433224.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3752352535801 + 470988473796 = 1937099^2 + 686286^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4223341009597 is a prime.
It is a super-2 number, since 2×42233410095972 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4223341009597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4223341009577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2111670504798 + 2111670504799.
It is an arithmetic number, because the mean of its divisors is an integer number (2111670504799).
Almost surely, 24223341009597 is an apocalyptic number.
It is an amenable number.
4223341009597 is a deficient number, since it is larger than the sum of its proper divisors (1).
4223341009597 is an equidigital number, since it uses as much as digits as its factorization.
4223341009597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 4223341009597 in words is "four trillion, two hundred twenty-three billion, three hundred forty-one million, nine thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •