Base | Representation |
---|---|
bin | 1011000000100001111… |
… | …1000101011001100101 |
3 | 200002011011101112101010 |
4 | 2300020133011121211 |
5 | 11044304424133313 |
6 | 222514141452433 |
7 | 16443410233662 |
oct | 2601037053145 |
9 | 602134345333 |
10 | 189120927333 |
11 | 73229918958 |
12 | 307a0271119 |
13 | 14aac484880 |
14 | 92212cca69 |
15 | 4dbd3204c3 |
hex | 2c087c5665 |
189120927333 has 32 divisors (see below), whose sum is σ = 272334053376. Its totient is φ = 116050108608.
The previous prime is 189120927319. The next prime is 189120927337. The reversal of 189120927333 is 333729021981.
It is not a de Polignac number, because 189120927333 - 25 = 189120927301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (189120927337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22133260 + ... + 22141802.
It is an arithmetic number, because the mean of its divisors is an integer number (8510439168).
Almost surely, 2189120927333 is an apocalyptic number.
189120927333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
189120927333 is a deficient number, since it is larger than the sum of its proper divisors (83213126043).
189120927333 is a wasteful number, since it uses less digits than its factorization.
189120927333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10113.
The product of its (nonzero) digits is 489888, while the sum is 48.
The spelling of 189120927333 in words is "one hundred eighty-nine billion, one hundred twenty million, nine hundred twenty-seven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •