Base | Representation |
---|---|
bin | 10100001101101000… |
… | …010011100011011011 |
3 | 2002000112222100100201 |
4 | 110031220103203123 |
5 | 323422044144024 |
6 | 13545341243031 |
7 | 1365555521050 |
oct | 241550234333 |
9 | 62015870321 |
10 | 21703506139 |
11 | 9228077437 |
12 | 4258563477 |
13 | 207b5b1033 |
14 | 109c641027 |
15 | 8705b3744 |
hex | 50da138db |
21703506139 has 8 divisors (see below), whose sum is σ = 25474385888. Its totient is φ = 18100221120.
The previous prime is 21703506137. The next prime is 21703506221. The reversal of 21703506139 is 93160530712.
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 21703506139 - 21 = 21703506137 is a prime.
It is a super-2 number, since 2×217035061392 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 21703506098 and 21703506107.
It is not an unprimeable number, because it can be changed into a prime (21703506137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41898402 + ... + 41898919.
It is an arithmetic number, because the mean of its divisors is an integer number (3184298236).
Almost surely, 221703506139 is an apocalyptic number.
21703506139 is a deficient number, since it is larger than the sum of its proper divisors (3770879749).
21703506139 is an equidigital number, since it uses as much as digits as its factorization.
21703506139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83797365.
The product of its (nonzero) digits is 34020, while the sum is 37.
The spelling of 21703506139 in words is "twenty-one billion, seven hundred three million, five hundred six thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •