Base | Representation |
---|---|
bin | 1111110110011000… |
… | …0110000101000111 |
3 | 101222111211012012110 |
4 | 3331212012011013 |
5 | 32203140401043 |
6 | 1542103152103 |
7 | 210301455561 |
oct | 37546060507 |
9 | 11874735173 |
10 | 4254622023 |
11 | 1893694553 |
12 | 9a8a45633 |
13 | 52a5c1b32 |
14 | 2c50b4331 |
15 | 19d7bdb33 |
hex | fd986147 |
4254622023 has 8 divisors (see below), whose sum is σ = 5675692288. Its totient is φ = 2834983224.
The previous prime is 4254622013. The next prime is 4254622027. The reversal of 4254622023 is 3202264524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4254622023 - 214 = 4254605639 is a prime.
It is a super-2 number, since 2×42546220232 = 36203617117193225058, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4254622027) 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 7 ways as a sum of consecutive naturals, for example, 350911 + ... + 362832.
It is an arithmetic number, because the mean of its divisors is an integer number (709461536).
Almost surely, 24254622023 is an apocalyptic number.
4254622023 is a deficient number, since it is larger than the sum of its proper divisors (1421070265).
4254622023 is a wasteful number, since it uses less digits than its factorization.
4254622023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715733.
The product of its (nonzero) digits is 23040, while the sum is 30.
The square root of 4254622023 is about 65227.4637173637. The cubic root of 4254622023 is about 1620.3928863424.
Adding to 4254622023 its reverse (3202264524), we get a palindrome (7456886547).
The spelling of 4254622023 in words is "four billion, two hundred fifty-four million, six hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •