Base | Representation |
---|---|
bin | 101100100110000001010110… |
… | …101101011001010000110011 |
3 | 221201102112122210022022021122 |
4 | 230212001112231121100303 |
5 | 201201320232341020300 |
6 | 1533043232125412455 |
7 | 56211460651045304 |
oct | 5446012655312063 |
9 | 851375583268248 |
10 | 196126841345075 |
11 | 57545a20a176a3 |
12 | 19bb684240a12b |
13 | 85588b2b442b4 |
14 | 36608384887ab |
15 | 17a1a989b4c85 |
hex | b26056b59433 |
196126841345075 has 48 divisors (see below), whose sum is σ = 254359869926400. Its totient is φ = 150015286388000.
The previous prime is 196126841345021. The next prime is 196126841345077. The reversal of 196126841345075 is 570543148621691.
It is not a de Polignac number, because 196126841345075 - 236 = 196058121868339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 196126841344999 and 196126841345017.
It is not an unprimeable number, because it can be changed into a prime (196126841345077) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 714978296 + ... + 715252554.
It is an arithmetic number, because the mean of its divisors is an integer number (5299163956800).
It is a 1-persistent number, because it is pandigital, but 2⋅196126841345075 = 392253682690150 is not.
Almost surely, 2196126841345075 is an apocalyptic number.
196126841345075 is a deficient number, since it is larger than the sum of its proper divisors (58233028581325).
196126841345075 is an equidigital number, since it uses as much as digits as its factorization.
196126841345075 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276689 (or 276638 counting only the distinct ones).
The product of its (nonzero) digits is 43545600, while the sum is 62.
The spelling of 196126841345075 in words is "one hundred ninety-six trillion, one hundred twenty-six billion, eight hundred forty-one million, three hundred forty-five thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •