Base | Representation |
---|---|
bin | 10111100101111101100… |
… | …001101010111000000001 |
3 | 12201222212210021000010001 |
4 | 113211331201222320001 |
5 | 203030420003231321 |
6 | 3240452515040001 |
7 | 225064353063031 |
oct | 27457541527001 |
9 | 5658783230101 |
10 | 1621308648961 |
11 | 575658512881 |
12 | 222278ba0001 |
13 | b9b72776571 |
14 | 586867058c1 |
15 | 2c29219cc91 |
hex | 1797d86ae01 |
1621308648961 has 8 divisors (see below), whose sum is σ = 1627314137064. Its totient is φ = 1615313934720.
The previous prime is 1621308648929. The next prime is 1621308649001. The reversal of 1621308648961 is 1698468031261.
It can be written as a sum of positive squares in 4 ways, for example, as 9790113025 + 1611518535936 = 98945^2 + 1269456^2 .
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 1621308648961 - 25 = 1621308648929 is a prime.
It is a super-3 number, since 3×16213086489613 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1621308648061) 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, 2391876 + ... + 2993941.
It is an arithmetic number, because the mean of its divisors is an integer number (203414267133).
Almost surely, 21621308648961 is an apocalyptic number.
It is an amenable number.
1621308648961 is a deficient number, since it is larger than the sum of its proper divisors (6005488103).
1621308648961 is an equidigital number, since it uses as much as digits as its factorization.
1621308648961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5386931.
The product of its (nonzero) digits is 2985984, while the sum is 55.
The spelling of 1621308648961 in words is "one trillion, six hundred twenty-one billion, three hundred eight million, six hundred forty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •