Base | Representation |
---|---|
bin | 1011011001110000110… |
… | …0111001110010000101 |
3 | 200201122012102012221201 |
4 | 2312130030321302011 |
5 | 11202142401001141 |
6 | 225554215342501 |
7 | 20103303566365 |
oct | 2663414716205 |
9 | 621565365851 |
10 | 195894156421 |
11 | 76095165147 |
12 | 31b70681a31 |
13 | 1561b7bc232 |
14 | 96a4a989a5 |
15 | 5167c93031 |
hex | 2d9c339c85 |
195894156421 has 8 divisors (see below), whose sum is σ = 206215204320. Its totient is φ = 185574191472.
The previous prime is 195894156413. The next prime is 195894156431. The reversal of 195894156421 is 124651498591.
195894156421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 195894156421 - 23 = 195894156413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195894156431) 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, 114651 + ... + 636343.
It is an arithmetic number, because the mean of its divisors is an integer number (25776900540).
Almost surely, 2195894156421 is an apocalyptic number.
It is an amenable number.
195894156421 is a deficient number, since it is larger than the sum of its proper divisors (10321047899).
195894156421 is a wasteful number, since it uses less digits than its factorization.
195894156421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 541475.
The product of its digits is 3110400, while the sum is 55.
The spelling of 195894156421 in words is "one hundred ninety-five billion, eight hundred ninety-four million, one hundred fifty-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •