Base | Representation |
---|---|
bin | 1001110110101010001111… |
… | …11000010000100100000010 |
3 | 2211201120021212220111121210 |
4 | 10323111013320100210002 |
5 | 10320012224340013222 |
6 | 114030425112030550 |
7 | 4364361564256245 |
oct | 473250770204402 |
9 | 84646255814553 |
10 | 21669315938562 |
11 | 69a49a5a25066 |
12 | 251b7aa092456 |
13 | c1253ba05926 |
14 | 54cb2c77525c |
15 | 278a069a5d0c |
hex | 13b547e10902 |
21669315938562 has 8 divisors (see below), whose sum is σ = 43338631877136. Its totient is φ = 7223105312852.
The previous prime is 21669315938467. The next prime is 21669315938563. The reversal of 21669315938562 is 26583951396612.
It is a sphenic number, since it is the product of 3 distinct primes.
21669315938562 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 21669315938493 and 21669315938502.
It is not an unprimeable number, because it can be changed into a prime (21669315938563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1805776328208 + ... + 1805776328219.
It is an arithmetic number, because the mean of its divisors is an integer number (5417328984642).
Almost surely, 221669315938562 is an apocalyptic number.
21669315938562 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21669315938562 is a wasteful number, since it uses less digits than its factorization.
21669315938562 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3611552656432.
The product of its digits is 125971200, while the sum is 66.
The spelling of 21669315938562 in words is "twenty-one trillion, six hundred sixty-nine billion, three hundred fifteen million, nine hundred thirty-eight thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •