Base | Representation |
---|---|
bin | 10110101110011… |
… | …01000111101111 |
3 | 111021201010112102 |
4 | 23113031013233 |
5 | 342300214211 |
6 | 30525525315 |
7 | 4503230453 |
oct | 1327150757 |
9 | 437633472 |
10 | 190632431 |
11 | 98674a70 |
12 | 53a1383b |
13 | 30657572 |
14 | 1b464663 |
15 | 11b08a3b |
hex | b5cd1ef |
190632431 has 8 divisors (see below), whose sum is σ = 208566144. Its totient is φ = 172799320.
The previous prime is 190632427. The next prime is 190632433. The reversal of 190632431 is 134236091.
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 190632431 - 22 = 190632427 is a prime.
It is a super-2 number, since 2×1906324312 = 72681447497939522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 190632394 and 190632403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (190632433) 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, 21155 + ... + 28788.
It is an arithmetic number, because the mean of its divisors is an integer number (26070768).
Almost surely, 2190632431 is an apocalyptic number.
190632431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
190632431 is a deficient number, since it is larger than the sum of its proper divisors (17933713).
190632431 is a wasteful number, since it uses less digits than its factorization.
190632431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50301.
The product of its (nonzero) digits is 3888, while the sum is 29.
The square root of 190632431 is about 13806.9703773130. The cubic root of 190632431 is about 575.5268577490.
The spelling of 190632431 in words is "one hundred ninety million, six hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •