Base | Representation |
---|---|
bin | 10011010010010011110… |
… | …101111111000110100110 |
3 | 11200200220112211112122100 |
4 | 103102103311333012212 |
5 | 133203234031030042 |
6 | 2452503124312530 |
7 | 164515630634136 |
oct | 23222365770646 |
9 | 4620815745570 |
10 | 1325330330022 |
11 | 471084469036 |
12 | 194a36542746 |
13 | 97c93bba9ba |
14 | 4820975cac6 |
15 | 2471cae824c |
hex | 13493d7f1a6 |
1325330330022 has 48 divisors (see below), whose sum is σ = 2879335499040. Its totient is φ = 440579904000.
The previous prime is 1325330330017. The next prime is 1325330330029. The reversal of 1325330330022 is 2200330335231.
1325330330022 is a `hidden beast` number, since 1 + 3 + 2 + 5 + 330 + 3 + 300 + 22 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1325330330029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15632647 + ... + 15717197.
It is an arithmetic number, because the mean of its divisors is an integer number (59986156230).
Almost surely, 21325330330022 is an apocalyptic number.
1325330330022 is an abundant number, since it is smaller than the sum of its proper divisors (1554005169018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1325330330022 is a wasteful number, since it uses less digits than its factorization.
1325330330022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86909 (or 86906 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 27.
Adding to 1325330330022 its reverse (2200330335231), we get a palindrome (3525660665253).
The spelling of 1325330330022 in words is "one trillion, three hundred twenty-five billion, three hundred thirty million, three hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •