Base | Representation |
---|---|
bin | 1011011011001001100… |
… | …0010100011110001011 |
3 | 200202121010120102202002 |
4 | 2312302120110132023 |
5 | 11203423124414300 |
6 | 230055150501215 |
7 | 20115442403612 |
oct | 2666230243613 |
9 | 622533512662 |
10 | 196266248075 |
11 | 762661a9107 |
12 | 3205520480b |
13 | 1567a90b901 |
14 | 96dc276879 |
15 | 518a7925d5 |
hex | 2db261478b |
196266248075 has 6 divisors (see below), whose sum is σ = 243370147644. Its totient is φ = 157012998440.
The previous prime is 196266248071. The next prime is 196266248081. The reversal of 196266248075 is 570842662691.
196266248075 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 196266248075 - 22 = 196266248071 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 196266248075.
It is not an unprimeable number, because it can be changed into a prime (196266248071) 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 5 ways as a sum of consecutive naturals, for example, 3925324937 + ... + 3925324986.
It is an arithmetic number, because the mean of its divisors is an integer number (40561691274).
Almost surely, 2196266248075 is an apocalyptic number.
196266248075 is a deficient number, since it is larger than the sum of its proper divisors (47103899569).
196266248075 is an equidigital number, since it uses as much as digits as its factorization.
196266248075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7850649933 (or 7850649928 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 56.
The spelling of 196266248075 in words is "one hundred ninety-six billion, two hundred sixty-six million, two hundred forty-eight thousand, seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •