Base | Representation |
---|---|
bin | 11111110010010000100… |
… | …10010010101000100001 |
3 | 10212101222201122022100000 |
4 | 33321020102102220201 |
5 | 120343142404311044 |
6 | 2153415235250213 |
7 | 141622052431020 |
oct | 17711022225041 |
9 | 3771881568300 |
10 | 1092134447649 |
11 | 391198473103 |
12 | 1577b5749969 |
13 | 7bcac37a19b |
14 | 3ac069da8b7 |
15 | 1d6201b1d69 |
hex | fe48492a21 |
1092134447649 has 192 divisors, whose sum is σ = 1952793722880. Its totient is φ = 597114685440.
The previous prime is 1092134447647. The next prime is 1092134447699. The reversal of 1092134447649 is 9467444312901.
It is a happy number.
1092134447649 is a `hidden beast` number, since 1 + 0 + 9 + 2 + 134 + 447 + 64 + 9 = 666.
It is not a de Polignac number, because 1092134447649 - 21 = 1092134447647 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1092134447595 and 1092134447604.
It is not an unprimeable number, because it can be changed into a prime (1092134447647) 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 191 ways as a sum of consecutive naturals, for example, 620882832 + ... + 620884590.
It is an arithmetic number, because the mean of its divisors is an integer number (10170800640).
Almost surely, 21092134447649 is an apocalyptic number.
It is an amenable number.
1092134447649 is a deficient number, since it is larger than the sum of its proper divisors (860659275231).
1092134447649 is an equidigital number, since it uses as much as digits as its factorization.
1092134447649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2002 (or 1990 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 54.
The spelling of 1092134447649 in words is "one trillion, ninety-two billion, one hundred thirty-four million, four hundred forty-seven thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •