Base | Representation |
---|---|
bin | 11110011101100100… |
… | …10100100111010101 |
3 | 1120012202022102212220 |
4 | 33032302110213111 |
5 | 231443133400041 |
6 | 11302451132553 |
7 | 1116162256305 |
oct | 171662244725 |
9 | 46182272786 |
10 | 16354200021 |
11 | 6a32579595 |
12 | 3204ba4159 |
13 | 1708280043 |
14 | b12013605 |
15 | 65ab5dd66 |
hex | 3cec949d5 |
16354200021 has 4 divisors (see below), whose sum is σ = 21805600032. Its totient is φ = 10902800012.
The previous prime is 16354199993. The next prime is 16354200043. The reversal of 16354200021 is 12000245361.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16354200021 - 27 = 16354199893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16354199964 and 16354200000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16354200221) 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, 2725700001 + ... + 2725700006.
It is an arithmetic number, because the mean of its divisors is an integer number (5451400008).
Almost surely, 216354200021 is an apocalyptic number.
It is an amenable number.
16354200021 is a deficient number, since it is larger than the sum of its proper divisors (5451400011).
16354200021 is an equidigital number, since it uses as much as digits as its factorization.
16354200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5451400010.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 16354200021 its reverse (12000245361), we get a palindrome (28354445382).
The spelling of 16354200021 in words is "sixteen billion, three hundred fifty-four million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •