Base | Representation |
---|---|
bin | 1011011001010001111… |
… | …1011101010001001000 |
3 | 200201022012000100220122 |
4 | 2312110133131101020 |
5 | 11201411242141012 |
6 | 225533315042412 |
7 | 20100143236550 |
oct | 2662437352110 |
9 | 621265010818 |
10 | 195764802632 |
11 | 76029144793 |
12 | 31b352a0408 |
13 | 155caa6b929 |
14 | 9691826160 |
15 | 515b740e72 |
hex | 2d947dd448 |
195764802632 has 32 divisors (see below), whose sum is σ = 419510593920. Its totient is φ = 83896283520.
The previous prime is 195764802631. The next prime is 195764802641. The reversal of 195764802632 is 236208467591.
195764802632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (195764802631) 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 7 ways as a sum of consecutive naturals, for example, 2576693 + ... + 2651579.
It is an arithmetic number, because the mean of its divisors is an integer number (13109706060).
It is a 1-persistent number, because it is pandigital, but 2⋅195764802632 = 391529605264 is not.
Almost surely, 2195764802632 is an apocalyptic number.
It is an amenable number.
195764802632 is an abundant number, since it is smaller than the sum of its proper divisors (223745791288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195764802632 is a wasteful number, since it uses less digits than its factorization.
195764802632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121581 (or 121577 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 53.
The spelling of 195764802632 in words is "one hundred ninety-five billion, seven hundred sixty-four million, eight hundred two thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •