Base | Representation |
---|---|
bin | 1001101101100000001011… |
… | …01001110100111111100001 |
3 | 2210121111010211021212010210 |
4 | 10312300011221310333201 |
5 | 10244333332043344003 |
6 | 113230111225444333 |
7 | 4332552454103556 |
oct | 466600551647741 |
9 | 83544124255123 |
10 | 21354672246753 |
11 | 689351384a42a |
12 | 248a8186406a9 |
13 | bbb977112531 |
14 | 53b80087ca2d |
15 | 27073d915503 |
hex | 136c05a74fe1 |
21354672246753 has 8 divisors (see below), whose sum is σ = 28473255396288. Its totient is φ = 14236268630864.
The previous prime is 21354672246737. The next prime is 21354672246773. The reversal of 21354672246753 is 35764227645312.
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 21354672246753 - 24 = 21354672246737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21354672246693 and 21354672246702.
It is not an unprimeable number, because it can be changed into a prime (21354672246773) 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 7 ways as a sum of consecutive naturals, for example, 44605626 + ... + 45081827.
It is an arithmetic number, because the mean of its divisors is an integer number (3559156924536).
Almost surely, 221354672246753 is an apocalyptic number.
It is an amenable number.
21354672246753 is a deficient number, since it is larger than the sum of its proper divisors (7118583149535).
21354672246753 is an equidigital number, since it uses as much as digits as its factorization.
21354672246753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89766823.
The product of its digits is 50803200, while the sum is 57.
The spelling of 21354672246753 in words is "twenty-one trillion, three hundred fifty-four billion, six hundred seventy-two million, two hundred forty-six thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •