Base | Representation |
---|---|
bin | 1011010110111010011… |
… | …0101000110010010101 |
3 | 200122122212220220021021 |
4 | 2311232212220302111 |
5 | 11144111030304423 |
6 | 225350250521141 |
7 | 20045324261635 |
oct | 2655646506225 |
9 | 618585826237 |
10 | 195129150613 |
11 | 75832355a41 |
12 | 319984361b1 |
13 | 1552916c587 |
14 | 963123c6c5 |
15 | 5120a2e95d |
hex | 2d6e9a8c95 |
195129150613 has 8 divisors (see below), whose sum is σ = 195910018200. Its totient is φ = 194348694528.
The previous prime is 195129150551. The next prime is 195129150637. The reversal of 195129150613 is 316051921591.
It can be written as a sum of positive squares in 4 ways, for example, as 4874413489 + 190254737124 = 69817^2 + 436182^2 .
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 195129150613 - 225 = 195095596181 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 195129150613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195129150683) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 865573 + ... + 1067461.
It is an arithmetic number, because the mean of its divisors is an integer number (24488752275).
Almost surely, 2195129150613 is an apocalyptic number.
It is an amenable number.
195129150613 is a deficient number, since it is larger than the sum of its proper divisors (780867587).
195129150613 is a wasteful number, since it uses less digits than its factorization.
195129150613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205751.
The product of its (nonzero) digits is 72900, while the sum is 43.
The spelling of 195129150613 in words is "one hundred ninety-five billion, one hundred twenty-nine million, one hundred fifty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •