Base | Representation |
---|---|
bin | 111110101101001… |
… | …0111011110110111 |
3 | 12102122011112002121 |
4 | 1331122113132313 |
5 | 13302120021202 |
6 | 544441220411 |
7 | 103066151110 |
oct | 17532273667 |
9 | 5378145077 |
10 | 2104063927 |
11 | 98a764409 |
12 | 4a8791707 |
13 | 276bb1854 |
14 | 15d627207 |
15 | c4abb537 |
hex | 7d6977b7 |
2104063927 has 8 divisors (see below), whose sum is σ = 2406362400. Its totient is φ = 1802194944.
The previous prime is 2104063921. The next prime is 2104063963. The reversal of 2104063927 is 7293604012.
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 2104063927 - 27 = 2104063799 is a prime.
It is a super-2 number, since 2×21040639272 = 8854170017805322658, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2104063892 and 2104063901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2104063921) 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, 96802 + ... + 116527.
It is an arithmetic number, because the mean of its divisors is an integer number (300795300).
Almost surely, 22104063927 is an apocalyptic number.
2104063927 is a deficient number, since it is larger than the sum of its proper divisors (302298473).
2104063927 is a wasteful number, since it uses less digits than its factorization.
2104063927 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214745.
The product of its (nonzero) digits is 18144, while the sum is 34.
The square root of 2104063927 is about 45870.0765968403. The cubic root of 2104063927 is about 1281.4046930510.
Adding to 2104063927 its reverse (7293604012), we get a palindrome (9397667939).
The spelling of 2104063927 in words is "two billion, one hundred four million, sixty-three thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •