Base | Representation |
---|---|
bin | 1000111111100110… |
… | …1001011111100010 |
3 | 20020020211210221200 |
4 | 2033321221133202 |
5 | 14421022112200 |
6 | 1035321502030 |
7 | 113553551355 |
oct | 21771513742 |
9 | 6206753850 |
10 | 2414254050 |
11 | 102986888a |
12 | 574641916 |
13 | 2c62398c0 |
14 | 18c8d029c |
15 | e1e3e800 |
hex | 8fe697e2 |
2414254050 has 144 divisors (see below), whose sum is σ = 7065250920. Its totient is φ = 587473920.
The previous prime is 2414254043. The next prime is 2414254061. The reversal of 2414254050 is 504524142.
It can be written as a sum of positive squares in 12 ways, for example, as 136960209 + 2277293841 = 11703^2 + 47721^2 .
It is a Curzon number.
It is an unprimeable number.
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 71 ways as a sum of consecutive naturals, for example, 518332 + ... + 522968.
Almost surely, 22414254050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2414254050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3532625460).
2414254050 is an abundant number, since it is smaller than the sum of its proper divisors (4650996870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2414254050 is a wasteful number, since it uses less digits than its factorization.
2414254050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4757 (or 4749 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 27.
The square root of 2414254050 is about 49135.0592754298. The cubic root of 2414254050 is about 1341.5112618291.
Adding to 2414254050 its reverse (504524142), we get a palindrome (2918778192).
The spelling of 2414254050 in words is "two billion, four hundred fourteen million, two hundred fifty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •