Base | Representation |
---|---|
bin | 1011011001011011010… |
… | …1000100000111100011 |
3 | 200201101220210212200220 |
4 | 2312112311010013203 |
5 | 11202001312134334 |
6 | 225541235414123 |
7 | 20101130501502 |
oct | 2662665040743 |
9 | 621356725626 |
10 | 195804021219 |
11 | 760492a1244 |
12 | 31b46454343 |
13 | 15605c208b1 |
14 | 9696b14839 |
15 | 515eddb449 |
hex | 2d96d441e3 |
195804021219 has 32 divisors (see below), whose sum is σ = 287095603200. Its totient is φ = 118234507680.
The previous prime is 195804021187. The next prime is 195804021239. The reversal of 195804021219 is 912120408591.
195804021219 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 195804021219 - 25 = 195804021187 is a prime.
It is a super-2 number, since 2×1958040212192 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (195804021239) 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 31 ways as a sum of consecutive naturals, for example, 520879 + ... + 814200.
It is an arithmetic number, because the mean of its divisors is an integer number (8971737600).
Almost surely, 2195804021219 is an apocalyptic number.
195804021219 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
195804021219 is a deficient number, since it is larger than the sum of its proper divisors (91291581981).
195804021219 is a wasteful number, since it uses less digits than its factorization.
195804021219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1335215.
The product of its (nonzero) digits is 51840, while the sum is 42.
The spelling of 195804021219 in words is "one hundred ninety-five billion, eight hundred four million, twenty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •