Base | Representation |
---|---|
bin | 1011000011110011111… |
… | …0100011000101110101 |
3 | 200011102112111212022211 |
4 | 2300330332203011311 |
5 | 11103110401400040 |
6 | 223141401253421 |
7 | 16504262605336 |
oct | 2607476430565 |
9 | 604375455284 |
10 | 190001590645 |
11 | 73640a43279 |
12 | 309a7194271 |
13 | 14bbca6aa19 |
14 | 92a625428d |
15 | 4e207cc8ea |
hex | 2c3cfa3175 |
190001590645 has 32 divisors (see below), whose sum is σ = 236558439936. Its totient is φ = 146416896000.
The previous prime is 190001590633. The next prime is 190001590673. The reversal of 190001590645 is 546095100091.
It is not a de Polignac number, because 190001590645 - 25 = 190001590613 is a prime.
It is a super-2 number, since 2×1900015906452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 190001590598 and 190001590607.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4102870 + ... + 4148920.
It is an arithmetic number, because the mean of its divisors is an integer number (7392451248).
Almost surely, 2190001590645 is an apocalyptic number.
It is an amenable number.
190001590645 is a deficient number, since it is larger than the sum of its proper divisors (46556849291).
190001590645 is a wasteful number, since it uses less digits than its factorization.
190001590645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46381.
The product of its (nonzero) digits is 48600, while the sum is 40.
The spelling of 190001590645 in words is "one hundred ninety billion, one million, five hundred ninety thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •