Base | Representation |
---|---|
bin | 1011011011000011110… |
… | …0001110110010111111 |
3 | 200202112110010222012210 |
4 | 2312300330032302333 |
5 | 11203400434420313 |
6 | 230052525231503 |
7 | 20115030251304 |
oct | 2666074166277 |
9 | 622473128183 |
10 | 196242107583 |
11 | 7625360aa95 |
12 | 32049102593 |
13 | 156759089b2 |
14 | 96d8d910ab |
15 | 51885c49c3 |
hex | 2db0f0ecbf |
196242107583 has 8 divisors (see below), whose sum is σ = 270678769200. Its totient is φ = 126316758848.
The previous prime is 196242107561. The next prime is 196242107599. The reversal of 196242107583 is 385701242691.
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 196242107583 - 29 = 196242107071 is a prime.
It is a super-2 number, since 2×1962421075832 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196242107683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1127828118 + ... + 1127828291.
It is an arithmetic number, because the mean of its divisors is an integer number (33834846150).
It is a 1-persistent number, because it is pandigital, but 2⋅196242107583 = 392484215166 is not.
Almost surely, 2196242107583 is an apocalyptic number.
196242107583 is a deficient number, since it is larger than the sum of its proper divisors (74436661617).
196242107583 is a wasteful number, since it uses less digits than its factorization.
196242107583 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2255656441.
The product of its (nonzero) digits is 725760, while the sum is 48.
The spelling of 196242107583 in words is "one hundred ninety-six billion, two hundred forty-two million, one hundred seven thousand, five hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •