Base | Representation |
---|---|
bin | 11111011100000011001… |
… | …001110011000011110101 |
3 | 21122112102111002212122021 |
4 | 133130003021303003311 |
5 | 240344020342344343 |
6 | 4332252305233141 |
7 | 312041154221263 |
oct | 37340311630365 |
9 | 7575374085567 |
10 | 2160421449973 |
11 | 76325864a606 |
12 | 2aa8549327b1 |
13 | 12895ac12977 |
14 | 767ca34d433 |
15 | 3b2e69690ed |
hex | 1f7032730f5 |
2160421449973 has 2 divisors, whose sum is σ = 2160421449974. Its totient is φ = 2160421449972.
The previous prime is 2160421449911. The next prime is 2160421450007. The reversal of 2160421449973 is 3799441240612.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2046665000689 + 113756449284 = 1430617^2 + 337278^2 .
It is a cyclic number.
It is not a de Polignac number, because 2160421449973 - 217 = 2160421318901 is a prime.
It is a super-3 number, since 3×21604214499733 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2160421449973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2160421449673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1080210724986 + 1080210724987.
It is an arithmetic number, because the mean of its divisors is an integer number (1080210724987).
Almost surely, 22160421449973 is an apocalyptic number.
It is an amenable number.
2160421449973 is a deficient number, since it is larger than the sum of its proper divisors (1).
2160421449973 is an equidigital number, since it uses as much as digits as its factorization.
2160421449973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2612736, while the sum is 52.
The spelling of 2160421449973 in words is "two trillion, one hundred sixty billion, four hundred twenty-one million, four hundred forty-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •