Base | Representation |
---|---|
bin | 111111010011111… |
… | …1100111111100111 |
3 | 12111001102211121010 |
4 | 1332213330333213 |
5 | 13322321341123 |
6 | 550445153303 |
7 | 103434060525 |
oct | 17647747747 |
9 | 5431384533 |
10 | 2124402663 |
11 | 9a0196189 |
12 | 4b355b833 |
13 | 27b1831c6 |
14 | 1621dd315 |
15 | c6787993 |
hex | 7e9fcfe7 |
2124402663 has 8 divisors (see below), whose sum is σ = 2834165248. Its totient is φ = 1415454264.
The previous prime is 2124402647. The next prime is 2124402691. The reversal of 2124402663 is 3662044212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2124402663 - 24 = 2124402647 is a prime.
It is a super-2 number, since 2×21244026632 = 9026173349122983138, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2124402663.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2124402463) 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, 197431 + ... + 207912.
It is an arithmetic number, because the mean of its divisors is an integer number (354270656).
Almost surely, 22124402663 is an apocalyptic number.
2124402663 is a deficient number, since it is larger than the sum of its proper divisors (709762585).
2124402663 is a wasteful number, since it uses less digits than its factorization.
2124402663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407093.
The product of its (nonzero) digits is 13824, while the sum is 30.
The square root of 2124402663 is about 46091.2428016429. The cubic root of 2124402663 is about 1285.5203195982.
Adding to 2124402663 its reverse (3662044212), we get a palindrome (5786446875).
The spelling of 2124402663 in words is "two billion, one hundred twenty-four million, four hundred two thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •