Base | Representation |
---|---|
bin | 1110111111001101… |
… | …0111011101010111 |
3 | 101101101101202101012 |
4 | 3233303113131113 |
5 | 31214421020210 |
6 | 1503115322435 |
7 | 201461543351 |
oct | 35763273527 |
9 | 11341352335 |
10 | 4023220055 |
11 | 1785003858 |
12 | 94345041b |
13 | 4c16916aa |
14 | 2a247a0d1 |
15 | 188310305 |
hex | efcd7757 |
4023220055 has 8 divisors (see below), whose sum is σ = 4828356000. Its totient is φ = 3218248096.
The previous prime is 4023220013. The next prime is 4023220129. The reversal of 4023220055 is 5500223204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4023220055 - 214 = 4023203671 is a prime.
It is a super-2 number, since 2×40232200552 = 32372599221908406050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4023220055.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21701 + ... + 92289.
It is an arithmetic number, because the mean of its divisors is an integer number (603544500).
Almost surely, 24023220055 is an apocalyptic number.
4023220055 is a deficient number, since it is larger than the sum of its proper divisors (805135945).
4023220055 is a wasteful number, since it uses less digits than its factorization.
4023220055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81993.
The product of its (nonzero) digits is 2400, while the sum is 23.
The square root of 4023220055 is about 63428.8582192680. The cubic root of 4023220055 is about 1590.4667557588.
Adding to 4023220055 its reverse (5500223204), we get a palindrome (9523443259).
The spelling of 4023220055 in words is "four billion, twenty-three million, two hundred twenty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •