Base | Representation |
---|---|
bin | 1011000101111111110… |
… | …1000100110011110111 |
3 | 200012221102201020002001 |
4 | 2301133331010303313 |
5 | 11110311113011111 |
6 | 223315523000131 |
7 | 16524646505311 |
oct | 2613775046367 |
9 | 605842636061 |
10 | 190588407031 |
11 | 739122070a0 |
12 | 30b2b809047 |
13 | 14c844cb959 |
14 | 93201687b1 |
15 | 4e570941c1 |
hex | 2c5ff44cf7 |
190588407031 has 32 divisors (see below), whose sum is σ = 214354086912. Its totient is φ = 168000000000.
The previous prime is 190588407019. The next prime is 190588407101. The reversal of 190588407031 is 130704885091.
It is a happy number.
It is a 12-Lehmer number, since φ(190588407031) divides (190588407031-1)12.
It is a cyclic number.
It is not a de Polignac number, because 190588407031 - 211 = 190588404983 is a prime.
It is a super-2 number, since 2×1905884070312 (a number of 23 digits) 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 (190588407001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11903031 + ... + 11919031.
It is an arithmetic number, because the mean of its divisors is an integer number (6698565216).
Almost surely, 2190588407031 is an apocalyptic number.
190588407031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
190588407031 is the 195238-th centered decagonal number.
190588407031 is a deficient number, since it is larger than the sum of its proper divisors (23765679881).
190588407031 is a wasteful number, since it uses less digits than its factorization.
190588407031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16335.
The product of its (nonzero) digits is 241920, while the sum is 46.
The spelling of 190588407031 in words is "one hundred ninety billion, five hundred eighty-eight million, four hundred seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •