Base | Representation |
---|---|
bin | 1011011010111101000… |
… | …1010000000110111111 |
3 | 200202110111101012000221 |
4 | 2312233101100012333 |
5 | 11203321300013201 |
6 | 230050044202211 |
7 | 20114240010262 |
oct | 2665721200677 |
9 | 622414335027 |
10 | 196214063551 |
11 | 762397a6100 |
12 | 3203b839367 |
13 | 1566cb6a0ac |
14 | 96d5370cd9 |
15 | 5185dd54a1 |
hex | 2daf4501bf |
196214063551 has 24 divisors (see below), whose sum is σ = 227808154112. Its totient is φ = 168607731600.
The previous prime is 196214063527. The next prime is 196214063557. The reversal of 196214063551 is 155360412691.
It is not a de Polignac number, because 196214063551 - 25 = 196214063519 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a junction number, because it is equal to n+sod(n) for n = 196214063498 and 196214063507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196214063557) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 446961 + ... + 769546.
Almost surely, 2196214063551 is an apocalyptic number.
196214063551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
196214063551 is a deficient number, since it is larger than the sum of its proper divisors (31594090561).
196214063551 is a wasteful number, since it uses less digits than its factorization.
196214063551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1216603 (or 1216592 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 43.
The spelling of 196214063551 in words is "one hundred ninety-six billion, two hundred fourteen million, sixty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •