Base | Representation |
---|---|
bin | 11010101010011… |
… | …11011001000000 |
3 | 120120212201010102 |
4 | 31111033121000 |
5 | 424224444442 |
6 | 34110021532 |
7 | 5354115404 |
oct | 1525173100 |
9 | 516781112 |
10 | 223671872 |
11 | 105290a96 |
12 | 62aa78a8 |
13 | 37454b28 |
14 | 219c5104 |
15 | 14983232 |
hex | d54f640 |
223671872 has 112 divisors (see below), whose sum is σ = 489825792. Its totient is φ = 101038080.
The previous prime is 223671869. The next prime is 223671881. The reversal of 223671872 is 278176322.
223671872 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
Its product of digits (56448) is a multiple of the sum of its prime factors (196).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3666722 + ... + 3666782.
Almost surely, 2223671872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 223671872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (244912896).
223671872 is an abundant number, since it is smaller than the sum of its proper divisors (266153920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
223671872 is a wasteful number, since it uses less digits than its factorization.
223671872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 186 counting only the distinct ones).
The product of its digits is 56448, while the sum is 38.
The square root of 223671872 is about 14955.6635426182. The cubic root of 223671872 is about 607.0211048557.
The spelling of 223671872 in words is "two hundred twenty-three million, six hundred seventy-one thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •