Base | Representation |
---|---|
bin | 1011000000100110000… |
… | …1010000111001110001 |
3 | 200002012101000221012121 |
4 | 2300021201100321301 |
5 | 11044323344312303 |
6 | 222520001354241 |
7 | 16444010551024 |
oct | 2601141207161 |
9 | 602171027177 |
10 | 189138275953 |
11 | 73238698160 |
12 | 307a6038981 |
13 | 14ab2c4a223 |
14 | 92237271bb |
15 | 4dbeaea9bd |
hex | 2c09850e71 |
189138275953 has 4 divisors (see below), whose sum is σ = 206332664688. Its totient is φ = 171943887220.
The previous prime is 189138275941. The next prime is 189138275959. The reversal of 189138275953 is 359572831981.
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, and also an emirpimes, since its reverse is a distinct semiprime: 359572831981 = 11 ⋅32688439271.
It is a cyclic number.
It is not a de Polignac number, because 189138275953 - 221 = 189136178801 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 189138275891 and 189138275900.
It is not an unprimeable number, because it can be changed into a prime (189138275959) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8597194351 + ... + 8597194372.
It is an arithmetic number, because the mean of its divisors is an integer number (51583166172).
Almost surely, 2189138275953 is an apocalyptic number.
It is an amenable number.
189138275953 is a deficient number, since it is larger than the sum of its proper divisors (17194388735).
189138275953 is a wasteful number, since it uses less digits than its factorization.
189138275953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17194388734.
The product of its digits is 16329600, while the sum is 61.
The spelling of 189138275953 in words is "one hundred eighty-nine billion, one hundred thirty-eight million, two hundred seventy-five thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •