Base | Representation |
---|---|
bin | 10110101001101… |
… | …01101011100101 |
3 | 111020112121122102 |
4 | 23110311223211 |
5 | 342120342013 |
6 | 30504341445 |
7 | 4465035143 |
oct | 1324655345 |
9 | 436477572 |
10 | 190012133 |
11 | 98290a23 |
12 | 53774885 |
13 | 3049b11c |
14 | 1b342593 |
15 | 11a34d58 |
hex | b535ae5 |
190012133 has 4 divisors (see below), whose sum is σ = 193127148. Its totient is φ = 186897120.
The previous prime is 190012129. The next prime is 190012139. The reversal of 190012133 is 331210091.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 331210091 = 53 ⋅6249247.
It can be written as a sum of positive squares in 2 ways, for example, as 19918369 + 170093764 = 4463^2 + 13042^2 .
It is a cyclic number.
It is not a de Polignac number, because 190012133 - 22 = 190012129 is a prime.
It is a super-2 number, since 2×1900121332 = 72209221374419378, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190012139) 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, 1557416 + ... + 1557537.
It is an arithmetic number, because the mean of its divisors is an integer number (48281787).
Almost surely, 2190012133 is an apocalyptic number.
It is an amenable number.
190012133 is a deficient number, since it is larger than the sum of its proper divisors (3115015).
190012133 is an equidigital number, since it uses as much as digits as its factorization.
190012133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3115014.
The product of its (nonzero) digits is 162, while the sum is 20.
The square root of 190012133 is about 13784.4888552314. The cubic root of 190012133 is about 574.9019447162.
The spelling of 190012133 in words is "one hundred ninety million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •