Base | Representation |
---|---|
bin | 1110111100000111… |
… | …0010101001011111 |
3 | 101100110221111110002 |
4 | 3233001302221133 |
5 | 31203104133343 |
6 | 1501533004515 |
7 | 201243225545 |
oct | 35701625137 |
9 | 11313844402 |
10 | 4010224223 |
11 | 17787378a5 |
12 | 93b02373b |
13 | 4bba91355 |
14 | 2a0855d95 |
15 | 1870e48b8 |
hex | ef072a5f |
4010224223 has 4 divisors (see below), whose sum is σ = 4010932128. Its totient is φ = 4009516320.
The previous prime is 4010224213. The next prime is 4010224237. The reversal of 4010224223 is 3224220104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4010224223 - 210 = 4010223199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4010224195 and 4010224204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4010224213) 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 3 ways as a sum of consecutive naturals, for example, 345386 + ... + 356807.
It is an arithmetic number, because the mean of its divisors is an integer number (1002733032).
Almost surely, 24010224223 is an apocalyptic number.
4010224223 is a deficient number, since it is larger than the sum of its proper divisors (707905).
4010224223 is an equidigital number, since it uses as much as digits as its factorization.
4010224223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707904.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 4010224223 is about 63326.3311980096. The cubic root of 4010224223 is about 1588.7523964462.
Adding to 4010224223 its reverse (3224220104), we get a palindrome (7234444327).
The spelling of 4010224223 in words is "four billion, ten million, two hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •