Base | Representation |
---|---|
bin | 1011000110111000001… |
… | …1011110010110001001 |
3 | 200020112220211122022022 |
4 | 2301232003132112021 |
5 | 11111302142344023 |
6 | 223355213134225 |
7 | 16533551305220 |
oct | 2615603362611 |
9 | 606486748268 |
10 | 190824965513 |
11 | 73a23799a76 |
12 | 30b96a8a375 |
13 | 14cc15161a0 |
14 | 9343745cb7 |
15 | 4e6cc207c8 |
hex | 2c6e0de589 |
190824965513 has 32 divisors (see below), whose sum is σ = 247321536000. Its totient is φ = 143092832256.
The previous prime is 190824965497. The next prime is 190824965531. The reversal of 190824965513 is 315569428091.
190824965513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 190824965513 - 24 = 190824965497 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (190824965543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 190088 + ... + 646361.
It is an arithmetic number, because the mean of its divisors is an integer number (7728798000).
Almost surely, 2190824965513 is an apocalyptic number.
190824965513 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
190824965513 is a deficient number, since it is larger than the sum of its proper divisors (56496570487).
190824965513 is a wasteful number, since it uses less digits than its factorization.
190824965513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836601.
The product of its (nonzero) digits is 2332800, while the sum is 53.
The spelling of 190824965513 in words is "one hundred ninety billion, eight hundred twenty-four million, nine hundred sixty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •