Base | Representation |
---|---|
bin | 1011000101011011011… |
… | …0111100111010000101 |
3 | 200012112210120022222121 |
4 | 2301112312330322011 |
5 | 11110003031304403 |
6 | 223252432125541 |
7 | 16521114435655 |
oct | 2612666747205 |
9 | 605483508877 |
10 | 190435806853 |
11 | 73844059346 |
12 | 30aa86968b1 |
13 | 14c5b9cc3a6 |
14 | 9307ba4365 |
15 | 4e4899e3bd |
hex | 2c56dbce85 |
190435806853 has 8 divisors (see below), whose sum is σ = 194076649976. Its totient is φ = 186811704000.
The previous prime is 190435806823. The next prime is 190435806889. The reversal of 190435806853 is 358608534091.
It can be written as a sum of positive squares in 4 ways, for example, as 3848093089 + 186587713764 = 62033^2 + 431958^2 .
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 190435806853 - 221 = 190433709701 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 190435806853.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190435806823) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4162098 + ... + 4207603.
It is an arithmetic number, because the mean of its divisors is an integer number (24259581247).
Almost surely, 2190435806853 is an apocalyptic number.
It is an amenable number.
190435806853 is a deficient number, since it is larger than the sum of its proper divisors (3640843123).
190435806853 is an equidigital number, since it uses as much as digits as its factorization.
190435806853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8370135.
The product of its (nonzero) digits is 3110400, while the sum is 52.
The spelling of 190435806853 in words is "one hundred ninety billion, four hundred thirty-five million, eight hundred six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •