Base | Representation |
---|---|
bin | 1011011000110000011… |
… | …0100011011101101001 |
3 | 200200221101011201202122 |
4 | 2312030012203131221 |
5 | 11201114224303211 |
6 | 225511330241025 |
7 | 20063514021524 |
oct | 2661406433551 |
9 | 620841151678 |
10 | 195624056681 |
11 | 75a66753219 |
12 | 31ab6126175 |
13 | 155a785cbc1 |
14 | 967ac69bbb |
15 | 514e1dd6db |
hex | 2d8c1a3769 |
195624056681 has 16 divisors (see below), whose sum is σ = 202988273664. Its totient is φ = 188406270864.
The previous prime is 195624056659. The next prime is 195624056699. The reversal of 195624056681 is 186650426591.
195624056681 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 195624056681 - 210 = 195624055657 is a prime.
It is a super-2 number, since 2×1956240566812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (195624056611) 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 15 ways as a sum of consecutive naturals, for example, 780260 + ... + 1000026.
It is an arithmetic number, because the mean of its divisors is an integer number (12686767104).
Almost surely, 2195624056681 is an apocalyptic number.
It is an amenable number.
195624056681 is a deficient number, since it is larger than the sum of its proper divisors (7364216983).
195624056681 is a wasteful number, since it uses less digits than its factorization.
195624056681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220100.
The product of its (nonzero) digits is 3110400, while the sum is 53.
The spelling of 195624056681 in words is "one hundred ninety-five billion, six hundred twenty-four million, fifty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •