Base | Representation |
---|---|
bin | 1101010110111001001… |
… | …1011001110100101101 |
3 | 210221100010100022000011 |
4 | 3111232103121310231 |
5 | 12224440331100312 |
6 | 253231243133221 |
7 | 22402552341331 |
oct | 3255623316455 |
9 | 727303308004 |
10 | 229483846957 |
11 | 89361715872 |
12 | 38585814211 |
13 | 18842794a71 |
14 | b16db6b7c1 |
15 | 5e81ae3da7 |
hex | 356e4d9d2d |
229483846957 has 4 divisors (see below), whose sum is σ = 242982896796. Its totient is φ = 215984797120.
The previous prime is 229483846919. The next prime is 229483846967. The reversal of 229483846957 is 759648384922.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 125442764041 + 104041082916 = 354179^2 + 322554^2 .
It is a cyclic number.
It is not a de Polignac number, because 229483846957 - 27 = 229483846829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 229483846892 and 229483846901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (229483846967) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6749524894 + ... + 6749524927.
It is an arithmetic number, because the mean of its divisors is an integer number (60745724199).
Almost surely, 2229483846957 is an apocalyptic number.
It is an amenable number.
229483846957 is a deficient number, since it is larger than the sum of its proper divisors (13499049839).
229483846957 is a wasteful number, since it uses less digits than its factorization.
229483846957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13499049838.
The product of its digits is 209018880, while the sum is 67.
The spelling of 229483846957 in words is "two hundred twenty-nine billion, four hundred eighty-three million, eight hundred forty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •