Base | Representation |
---|---|
bin | 11110000100001111111111… |
… | …010111010011001101000000 |
3 | 122100012101121221222210112012 |
4 | 132010033333113103031000 |
5 | 114313003042231040000 |
6 | 1145123112124352052 |
7 | 36565356655206566 |
oct | 3604177727231500 |
9 | 570171557883465 |
10 | 132233442440000 |
11 | 39151984a36380 |
12 | 129b78883a5628 |
13 | 58a2738765955 |
14 | 24921c0431a36 |
15 | 1044a66961735 |
hex | 7843ff5d3340 |
132233442440000 has 140 divisors (see below), whose sum is σ = 357704686334688. Its totient is φ = 48084888000000.
The previous prime is 132233442439961. The next prime is 132233442440009. The reversal of 132233442440000 is 44244332231.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132233442440009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 149825276 + ... + 150705275.
Almost surely, 2132233442440000 is an apocalyptic number.
132233442440000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132233442440000 is an abundant number, since it is smaller than the sum of its proper divisors (225471243894688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132233442440000 is an equidigital number, since it uses as much as digits as its factorization.
132233442440000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300530594 (or 300530569 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 132233442440000 its reverse (44244332231), we get a palindrome (132277686772231).
The spelling of 132233442440000 in words is "one hundred thirty-two trillion, two hundred thirty-three billion, four hundred forty-two million, four hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •