Base | Representation |
---|---|
bin | 10111011011100… |
… | …00110000010011 |
3 | 111200211112211000 |
4 | 23231300300103 |
5 | 400303424210 |
6 | 31300353043 |
7 | 4604416053 |
oct | 1355606023 |
9 | 450745730 |
10 | 196545555 |
11 | a0a43648 |
12 | 559a5783 |
13 | 31947b5b |
14 | 1c163563 |
15 | 123c5ac0 |
hex | bb70c13 |
196545555 has 16 divisors (see below), whose sum is σ = 349414560. Its totient is φ = 104824224.
The previous prime is 196545541. The next prime is 196545593. The reversal of 196545555 is 555545691.
196545555 is a `hidden beast` number, since 1 + 96 + 5 + 4 + 5 + 555 = 666.
196545555 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 196545555 - 25 = 196545523 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 196545555.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 727812 + ... + 728081.
It is an arithmetic number, because the mean of its divisors is an integer number (21838410).
Almost surely, 2196545555 is an apocalyptic number.
196545555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
196545555 is a deficient number, since it is larger than the sum of its proper divisors (152869005).
196545555 is a wasteful number, since it uses less digits than its factorization.
196545555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1455907 (or 1455901 counting only the distinct ones).
The product of its digits is 675000, while the sum is 45.
The square root of 196545555 is about 14019.4705677497. The cubic root of 196545555 is about 581.4170217209.
The spelling of 196545555 in words is "one hundred ninety-six million, five hundred forty-five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •