Base | Representation |
---|---|
bin | 1111011011110100… |
… | …0100001110010111 |
3 | 101200202011112100020 |
4 | 3312331010032113 |
5 | 31441130000343 |
6 | 1523043120223 |
7 | 204446434455 |
oct | 36675041627 |
9 | 11622145306 |
10 | 4143203223 |
11 | 18368039a5 |
12 | 977673073 |
13 | 5104b0a53 |
14 | 2b438d9d5 |
15 | 193b10b83 |
hex | f6f44397 |
4143203223 has 16 divisors (see below), whose sum is σ = 5548681440. Its totient is φ = 2749953024.
The previous prime is 4143203221. The next prime is 4143203231. The reversal of 4143203223 is 3223023414.
It is not a de Polignac number, because 4143203223 - 21 = 4143203221 is a prime.
It is a super-2 number, since 2×41432032232 = 34332265894155175458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4143203193 and 4143203202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4143203221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 945265 + ... + 949637.
It is an arithmetic number, because the mean of its divisors is an integer number (346792590).
Almost surely, 24143203223 is an apocalyptic number.
4143203223 is a deficient number, since it is larger than the sum of its proper divisors (1405478217).
4143203223 is a wasteful number, since it uses less digits than its factorization.
4143203223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5698.
The product of its (nonzero) digits is 3456, while the sum is 24.
The square root of 4143203223 is about 64367.7187959928. The cubic root of 4143203223 is about 1606.1227927381.
Adding to 4143203223 its reverse (3223023414), we get a palindrome (7366226637).
The spelling of 4143203223 in words is "four billion, one hundred forty-three million, two hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •