Base | Representation |
---|---|
bin | 11010001100000… |
… | …11011111001000 |
3 | 120022101110022221 |
4 | 31012003133020 |
5 | 422220102302 |
6 | 33444423424 |
7 | 5305225255 |
oct | 1506033710 |
9 | 508343287 |
10 | 219690952 |
11 | 103012078 |
12 | 616a7b74 |
13 | 3668cb60 |
14 | 2126a42c |
15 | 14448937 |
hex | d1837c8 |
219690952 has 16 divisors (see below), whose sum is σ = 443606940. Its totient is φ = 101395776.
The previous prime is 219690943. The next prime is 219690959. The reversal of 219690952 is 259096912.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 165019716 + 54671236 = 12846^2 + 7394^2 .
It is a super-2 number, since 2×2196909522 = 96528228781332608, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 219690899 and 219690908.
It is not an unprimeable number, because it can be changed into a prime (219690959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1056103 + ... + 1056310.
Almost surely, 2219690952 is an apocalyptic number.
It is an amenable number.
219690952 is an abundant number, since it is smaller than the sum of its proper divisors (223915988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
219690952 is a wasteful number, since it uses less digits than its factorization.
219690952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2112432 (or 2112428 counting only the distinct ones).
The product of its (nonzero) digits is 87480, while the sum is 43.
The square root of 219690952 is about 14821.9753069555. The cubic root of 219690952 is about 603.3982648051.
The spelling of 219690952 in words is "two hundred nineteen million, six hundred ninety thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •