Base | Representation |
---|---|
bin | 11010100110111… |
… | …11101000110011 |
3 | 120120000110020001 |
4 | 31103133220303 |
5 | 424120323011 |
6 | 34052130431 |
7 | 5350201030 |
oct | 1523375063 |
9 | 516013201 |
10 | 223214131 |
11 | 104aa9098 |
12 | 62906a17 |
13 | 3732468a |
14 | 21906387 |
15 | 148e27c1 |
hex | d4dfa33 |
223214131 has 32 divisors (see below), whose sum is σ = 283668480. Its totient is φ = 171225600.
The previous prime is 223214119. The next prime is 223214137. The reversal of 223214131 is 131412322.
It is a happy number.
It is not a de Polignac number, because 223214131 - 25 = 223214099 is a prime.
It is a super-4 number, since 4×2232141314 (a number of 34 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3, 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223214099 and 223214108.
It is not an unprimeable number, because it can be changed into a prime (223214137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 244566 + ... + 245476.
It is an arithmetic number, because the mean of its divisors is an integer number (8864640).
Almost surely, 2223214131 is an apocalyptic number.
223214131 is a deficient number, since it is larger than the sum of its proper divisors (60454349).
223214131 is a wasteful number, since it uses less digits than its factorization.
223214131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035.
The product of its digits is 288, while the sum is 19.
The square root of 223214131 is about 14940.3524389487. The cubic root of 223214131 is about 606.6067356502.
Adding to 223214131 its reverse (131412322), we get a palindrome (354626453).
The spelling of 223214131 in words is "two hundred twenty-three million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.992 sec. • engine limits •