Base | Representation |
---|---|
bin | 10111110101110… |
… | …01110010110111 |
3 | 111221022120022220 |
4 | 23322321302313 |
5 | 402144143310 |
6 | 31502253423 |
7 | 4645614360 |
oct | 1372716267 |
9 | 457276286 |
10 | 199990455 |
11 | a2986875 |
12 | 56b87273 |
13 | 32582b62 |
14 | 1c7bcb67 |
15 | 12856670 |
hex | beb9cb7 |
199990455 has 32 divisors (see below), whose sum is σ = 377499648. Its totient is φ = 88473600.
The previous prime is 199990421. The next prime is 199990477. The reversal of 199990455 is 554099991.
It is a happy number.
It is not a de Polignac number, because 199990455 - 28 = 199990199 is a prime.
It is a super-2 number, since 2×1999904552 = 79992364182214050, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 199990398 and 199990407.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 27466 + ... + 33975.
It is an arithmetic number, because the mean of its divisors is an integer number (11796864).
Almost surely, 2199990455 is an apocalyptic number.
199990455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
199990455 is a deficient number, since it is larger than the sum of its proper divisors (177509193).
199990455 is a wasteful number, since it uses less digits than its factorization.
199990455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61487.
The product of its (nonzero) digits is 656100, while the sum is 51.
The square root of 199990455 is about 14141.7981529931. The cubic root of 199990455 is about 584.7942442448.
The spelling of 199990455 in words is "one hundred ninety-nine million, nine hundred ninety thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •