Base | Representation |
---|---|
bin | 10011011001000001001… |
… | …010000010011010011101 |
3 | 11201101111111221201000011 |
4 | 103121001022002122131 |
5 | 133313011422342000 |
6 | 2500053543003221 |
7 | 165162260501260 |
oct | 23310112023235 |
9 | 4641444851004 |
10 | 1332533012125 |
11 | 474140167777 |
12 | 196306739511 |
13 | 988711a9983 |
14 | 486d0198cd7 |
15 | 249e00eb2ba |
hex | 1364128269d |
1332533012125 has 64 divisors (see below), whose sum is σ = 1972054536192. Its totient is φ = 879676416000.
The previous prime is 1332533012123. The next prime is 1332533012141. The reversal of 1332533012125 is 5212103352331.
It is not a de Polignac number, because 1332533012125 - 21 = 1332533012123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332533012123) 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 63 ways as a sum of consecutive naturals, for example, 5107857 + ... + 5362393.
It is an arithmetic number, because the mean of its divisors is an integer number (30813352128).
Almost surely, 21332533012125 is an apocalyptic number.
It is an amenable number.
1332533012125 is a deficient number, since it is larger than the sum of its proper divisors (639521524067).
1332533012125 is a wasteful number, since it uses less digits than its factorization.
1332533012125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254783 (or 254773 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 1332533012125 its reverse (5212103352331), we get a palindrome (6544636364456).
The spelling of 1332533012125 in words is "one trillion, three hundred thirty-two billion, five hundred thirty-three million, twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •