Base | Representation |
---|---|
bin | 1000111111100100… |
… | …0111000011111111 |
3 | 20020020120122111110 |
4 | 2033321013003333 |
5 | 14421003104043 |
6 | 1035314453103 |
7 | 113552423250 |
oct | 21771070377 |
9 | 6206518443 |
10 | 2414113023 |
11 | 1029781933 |
12 | 574594193 |
13 | 2c61ba65a |
14 | 18c894b27 |
15 | e1e12b33 |
hex | 8fe470ff |
2414113023 has 8 divisors (see below), whose sum is σ = 3678648448. Its totient is φ = 1379493144.
The previous prime is 2414113007. The next prime is 2414113043. The reversal of 2414113023 is 3203114142.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2414113023 - 24 = 2414113007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 114957763 = 2414113023 / (2 + 4 + 1 + 4 + 1 + 1 + 3 + 0 + 2 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2414113043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57478861 + ... + 57478902.
It is an arithmetic number, because the mean of its divisors is an integer number (459831056).
Almost surely, 22414113023 is an apocalyptic number.
2414113023 is a deficient number, since it is larger than the sum of its proper divisors (1264535425).
2414113023 is a wasteful number, since it uses less digits than its factorization.
2414113023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114957773.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 2414113023 is about 49133.6241590217. The cubic root of 2414113023 is about 1341.4851401660.
Adding to 2414113023 its reverse (3203114142), we get a palindrome (5617227165).
The spelling of 2414113023 in words is "two billion, four hundred fourteen million, one hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •