Base | Representation |
---|---|
bin | 10001101111001110… |
… | …010100101110000001 |
3 | 1211011100012201022001 |
4 | 101233032110232001 |
5 | 303001222120131 |
6 | 12425523344001 |
7 | 1242655302535 |
oct | 215716245601 |
9 | 54140181261 |
10 | 19045895041 |
11 | 8093a02928 |
12 | 3836522001 |
13 | 1a46b195a4 |
14 | cc96c3bc5 |
15 | 767103261 |
hex | 46f394b81 |
19045895041 has 8 divisors (see below), whose sum is σ = 19909145600. Its totient is φ = 18198198720.
The previous prime is 19045895027. The next prime is 19045895047. The reversal of 19045895041 is 14059854091.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 19045895041 - 211 = 19045892993 is a prime.
It is a super-2 number, since 2×190458950412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 19045894982 and 19045895000.
It is not an unprimeable number, because it can be changed into a prime (19045895047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3886056 + ... + 3890953.
It is an arithmetic number, because the mean of its divisors is an integer number (2488643200).
Almost surely, 219045895041 is an apocalyptic number.
It is an amenable number.
19045895041 is a deficient number, since it is larger than the sum of its proper divisors (863250559).
19045895041 is an equidigital number, since it uses as much as digits as its factorization.
19045895041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7777119.
The product of its (nonzero) digits is 259200, while the sum is 46.
The spelling of 19045895041 in words is "nineteen billion, forty-five million, eight hundred ninety-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •