Base | Representation |
---|---|
bin | 110100001011001101110010… |
… | …011001101001110110110111 |
3 | 1010002111000221201000212001011 |
4 | 310023031302121221312313 |
5 | 220034110243041113223 |
6 | 2132012355525213051 |
7 | 66222412063263400 |
oct | 6413156231516667 |
9 | 1102430851025034 |
10 | 229469137051063 |
11 | 67130350687638 |
12 | 218a07a5861187 |
13 | 9b06b014950b0 |
14 | 4094518cac9a7 |
15 | 1b7e04399c80d |
hex | d0b372669db7 |
229469137051063 has 48 divisors (see below), whose sum is σ = 290334807622944. Its totient is φ = 179748766310400.
The previous prime is 229469137051051. The next prime is 229469137051087. The reversal of 229469137051063 is 360150731964922.
It is not a de Polignac number, because 229469137051063 - 25 = 229469137051031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 229469137050989 and 229469137051007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (229469137051003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 108071131 + ... + 110173987.
It is an arithmetic number, because the mean of its divisors is an integer number (6048641825478).
Almost surely, 2229469137051063 is an apocalyptic number.
229469137051063 is a deficient number, since it is larger than the sum of its proper divisors (60865670571881).
229469137051063 is a wasteful number, since it uses less digits than its factorization.
229469137051063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2104592 (or 2104585 counting only the distinct ones).
The product of its (nonzero) digits is 14696640, while the sum is 58.
The spelling of 229469137051063 in words is "two hundred twenty-nine trillion, four hundred sixty-nine billion, one hundred thirty-seven million, fifty-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •