Base | Representation |
---|---|
bin | 10011111010100001… |
… | …000111001111101001 |
3 | 2001012012121111210002 |
4 | 103322201013033221 |
5 | 322243002303414 |
6 | 13453444432345 |
7 | 1354613154035 |
oct | 237241071751 |
9 | 61165544702 |
10 | 21382853609 |
11 | 9083077447 |
12 | 41890a86b5 |
13 | 202a031b00 |
14 | 106bc131c5 |
15 | 8523754de |
hex | 4fa8473e9 |
21382853609 has 12 divisors (see below), whose sum is σ = 23359139676. Its totient is φ = 19563328512.
The previous prime is 21382853587. The next prime is 21382853629. The reversal of 21382853609 is 90635828312.
It can be written as a sum of positive squares in 6 ways, for example, as 10532506384 + 10850347225 = 102628^2 + 104165^2 .
It is not a de Polignac number, because 21382853609 - 224 = 21366076393 is a prime.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (21382853629) 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 11 ways as a sum of consecutive naturals, for example, 540752 + ... + 578945.
It is an arithmetic number, because the mean of its divisors is an integer number (1946594973).
Almost surely, 221382853609 is an apocalyptic number.
It is an amenable number.
21382853609 is a deficient number, since it is larger than the sum of its proper divisors (1976286067).
21382853609 is a wasteful number, since it uses less digits than its factorization.
21382853609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1119836 (or 1119823 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 47.
The spelling of 21382853609 in words is "twenty-one billion, three hundred eighty-two million, eight hundred fifty-three thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •