Search a number
-
+
229483962651 = 3593389382567
BaseRepresentation
bin1101010110111001001…
…1110110000100011011
3210221100010120011201010
43111232103312010123
512224440343301101
6253231245425003
722402553332536
oct3255623660433
9727303504633
10229483962651
1189361794789
123858586b163
1318842805618
14b16db9ba1d
155e81b182d6
hex356e4f611b

229483962651 has 16 divisors (see below), whose sum is σ = 311257324800. Its totient is φ = 150351498528.

The previous prime is 229483962649. The next prime is 229483962683. The reversal of 229483962651 is 156269384922.

It is not a de Polignac number, because 229483962651 - 21 = 229483962649 is a prime.

It is a super-2 number, since 2×2294839626512 (a number of 24 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 229483962591 and 229483962600.

It is not an unprimeable number, because it can be changed into a prime (229483962451) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 408570 + ... + 791136.

It is an arithmetic number, because the mean of its divisors is an integer number (19453582800).

Almost surely, 2229483962651 is an apocalyptic number.

229483962651 is a deficient number, since it is larger than the sum of its proper divisors (81773362149).

229483962651 is a wasteful number, since it uses less digits than its factorization.

229483962651 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 386018.

The product of its digits is 11197440, while the sum is 57.

The spelling of 229483962651 in words is "two hundred twenty-nine billion, four hundred eighty-three million, nine hundred sixty-two thousand, six hundred fifty-one".

Divisors: 1 3 59 177 3389 10167 199951 382567 599853 1147701 22571453 67714359 1296519563 3889558689 76494654217 229483962651