Base | Representation |
---|---|
bin | 1011011010001100001… |
… | …1110111001011001110 |
3 | 200201221012221102001110 |
4 | 2312203003313023032 |
5 | 11202411330230313 |
6 | 230013445552450 |
7 | 20106201640116 |
oct | 2664303671316 |
9 | 621835842043 |
10 | 196009226958 |
11 | 7614410a366 |
12 | 31ba3115726 |
13 | 156395ab4cc |
14 | 96b6090046 |
15 | 5172e22ec3 |
hex | 2da30f72ce |
196009226958 has 8 divisors (see below), whose sum is σ = 392018453928. Its totient is φ = 65336408984.
The previous prime is 196009226951. The next prime is 196009226989. The reversal of 196009226958 is 859622900691.
196009226958 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
196009226958 is an admirable number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 196009226898 and 196009226907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196009226951) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16334102241 + ... + 16334102252.
It is an arithmetic number, because the mean of its divisors is an integer number (49002306741).
Almost surely, 2196009226958 is an apocalyptic number.
196009226958 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196009226958 is a wasteful number, since it uses less digits than its factorization.
196009226958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32668204498.
The product of its (nonzero) digits is 4199040, while the sum is 57.
The spelling of 196009226958 in words is "one hundred ninety-six billion, nine million, two hundred twenty-six thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •