Base | Representation |
---|---|
bin | 110100001111100101011100… |
… | …111001111101110111011101 |
3 | 1010010112202001020011011222201 |
4 | 310033211130321331313131 |
5 | 220104020240034233342 |
6 | 2132402341035411501 |
7 | 66253202345335255 |
oct | 6417453471756735 |
9 | 1103482036134881 |
10 | 229769424133597 |
11 | 67236735935227 |
12 | 2192aa2b2b3b91 |
13 | 9b2921891b00a |
14 | 40a4c841c0965 |
15 | 1b86c6b467db7 |
hex | d0f95ce7dddd |
229769424133597 has 2 divisors, whose sum is σ = 229769424133598. Its totient is φ = 229769424133596.
The previous prime is 229769424133589. The next prime is 229769424133603. The reversal of 229769424133597 is 795331424967922.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 201987026781796 + 27782397351801 = 14212214^2 + 5270901^2 .
It is a cyclic number.
It is not a de Polignac number, because 229769424133597 - 23 = 229769424133589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (229769124133597) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 114884712066798 + 114884712066799.
It is an arithmetic number, because the mean of its divisors is an integer number (114884712066799).
Almost surely, 2229769424133597 is an apocalyptic number.
It is an amenable number.
229769424133597 is a deficient number, since it is larger than the sum of its proper divisors (1).
229769424133597 is an equidigital number, since it uses as much as digits as its factorization.
229769424133597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1234517760, while the sum is 73.
The spelling of 229769424133597 in words is "two hundred twenty-nine trillion, seven hundred sixty-nine billion, four hundred twenty-four million, one hundred thirty-three thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •