Base | Representation |
---|---|
bin | 10011011000101001110… |
… | …100100111100100110000 |
3 | 11201100111020021220102021 |
4 | 103120221310213210300 |
5 | 133311211212134300 |
6 | 2455551040001224 |
7 | 165146465046310 |
oct | 23305164474460 |
9 | 4640436256367 |
10 | 1332141521200 |
11 | 473a5a183856 |
12 | 196217600214 |
13 | 9880b057439 |
14 | 486941ab440 |
15 | 249baa68d1a |
hex | 13629d27930 |
1332141521200 has 60 divisors (see below), whose sum is σ = 3657680013040. Its totient is φ = 456734234880.
The previous prime is 1332141521159. The next prime is 1332141521203. The reversal of 1332141521200 is 21251412331.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1332141521203) 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 11 ways as a sum of consecutive naturals, for example, 237879615 + ... + 237885214.
Almost surely, 21332141521200 is an apocalyptic number.
1332141521200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1332141521200 is an abundant number, since it is smaller than the sum of its proper divisors (2325538491840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1332141521200 is a wasteful number, since it uses less digits than its factorization.
1332141521200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475764854 (or 475764843 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 1332141521200 its reverse (21251412331), we get a palindrome (1353392933531).
The spelling of 1332141521200 in words is "one trillion, three hundred thirty-two billion, one hundred forty-one million, five hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •