Base | Representation |
---|---|
bin | 11100101101011000011… |
… | …101001001010001111111 |
3 | 20222121022222112111102122 |
4 | 130231120131021101333 |
5 | 224310421222232223 |
6 | 4110154213113155 |
7 | 262351441341065 |
oct | 34553035112177 |
9 | 6877288474378 |
10 | 1972874024063 |
11 | 6a0766a54658 |
12 | 27a4336287bb |
13 | 11406c746837 |
14 | 6b6b8018035 |
15 | 364bb8615c8 |
hex | 1cb5874947f |
1972874024063 has 4 divisors (see below), whose sum is σ = 2058651155568. Its totient is φ = 1887096892560.
The previous prime is 1972874023999. The next prime is 1972874024083. The reversal of 1972874024063 is 3604204782791.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1972874024063 - 26 = 1972874023999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1972874023996 and 1972874024014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1972874024083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42888565718 + ... + 42888565763.
It is an arithmetic number, because the mean of its divisors is an integer number (514662788892).
Almost surely, 21972874024063 is an apocalyptic number.
1972874024063 is a deficient number, since it is larger than the sum of its proper divisors (85777131505).
1972874024063 is an equidigital number, since it uses as much as digits as its factorization.
1972874024063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85777131504.
The product of its (nonzero) digits is 4064256, while the sum is 53.
The spelling of 1972874024063 in words is "one trillion, nine hundred seventy-two billion, eight hundred seventy-four million, twenty-four thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •