Base | Representation |
---|---|
bin | 10011110110100011… |
… | …000100110101111001 |
3 | 2001000120022011102020 |
4 | 103312203010311321 |
5 | 322123430243233 |
6 | 13443105225053 |
7 | 1353144133155 |
oct | 236643046571 |
9 | 61016264366 |
10 | 21316259193 |
11 | 9049522039 |
12 | 416a932189 |
13 | 20192b6428 |
14 | 106303a065 |
15 | 84b5bd9b3 |
hex | 4f68c4d79 |
21316259193 has 8 divisors (see below), whose sum is σ = 28526557056. Its totient is φ = 14158400400.
The previous prime is 21316259189. The next prime is 21316259207. The reversal of 21316259193 is 39195261312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21316259193 - 22 = 21316259189 is a prime.
It is a super-2 number, since 2×213162591932 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (21316259143) 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 7 ways as a sum of consecutive naturals, for example, 13108818 + ... + 13110443.
It is an arithmetic number, because the mean of its divisors is an integer number (3565819632).
Almost surely, 221316259193 is an apocalyptic number.
It is an amenable number.
21316259193 is a deficient number, since it is larger than the sum of its proper divisors (7210297863).
21316259193 is a wasteful number, since it uses less digits than its factorization.
21316259193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26219535.
The product of its digits is 87480, while the sum is 42.
The spelling of 21316259193 in words is "twenty-one billion, three hundred sixteen million, two hundred fifty-nine thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •