Base | Representation |
---|---|
bin | 1001110110101010101110… |
… | …01110001101100100000101 |
3 | 2211201120221211021110001011 |
4 | 10323111113032031210011 |
5 | 10320013241234223220 |
6 | 114030510425202221 |
7 | 4364401141244650 |
oct | 473252716154405 |
9 | 84646854243034 |
10 | 21669573351685 |
11 | 69a5018261386 |
12 | 251b860330371 |
13 | c1258014259c |
14 | 54cb54a20897 |
15 | 278a1e3a165a |
hex | 13b55738d905 |
21669573351685 has 16 divisors (see below), whose sum is σ = 31282391606400. Its totient is φ = 14077076222016.
The previous prime is 21669573351667. The next prime is 21669573351689. The reversal of 21669573351685 is 58615337596612.
It is a cyclic number.
It is not a de Polignac number, because 21669573351685 - 227 = 21669439133957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21669573351685.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21669573351689) 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 15 ways as a sum of consecutive naturals, for example, 16292911630 + ... + 16292912959.
It is an arithmetic number, because the mean of its divisors is an integer number (1955149475400).
Almost surely, 221669573351685 is an apocalyptic number.
It is an amenable number.
21669573351685 is a deficient number, since it is larger than the sum of its proper divisors (9612818254715).
21669573351685 is a wasteful number, since it uses less digits than its factorization.
21669573351685 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32585824620.
The product of its digits is 244944000, while the sum is 67.
The spelling of 21669573351685 in words is "twenty-one trillion, six hundred sixty-nine billion, five hundred seventy-three million, three hundred fifty-one thousand, six hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •