Base | Representation |
---|---|
bin | 11110010001000000011101… |
… | …011111000100010111010000 |
3 | 122110022012111012121010200120 |
4 | 132101000131133010113100 |
5 | 114421334012001334412 |
6 | 1151033540115150240 |
7 | 40015613614100253 |
oct | 3621003537042720 |
9 | 573265435533616 |
10 | 133110121121232 |
11 | 3945a75a221202 |
12 | 12b197722a5380 |
13 | 59372cc70c348 |
14 | 24c27c83a709a |
15 | 105c77685cb8c |
hex | 79101d7c45d0 |
133110121121232 has 80 divisors (see below), whose sum is σ = 345206214673920. Its totient is φ = 44197540448256.
The previous prime is 133110121121221. The next prime is 133110121121251. The reversal of 133110121121232 is 232121121011331.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18541068 + ... + 24698004.
It is an arithmetic number, because the mean of its divisors is an integer number (4315077683424).
Almost surely, 2133110121121232 is an apocalyptic number.
133110121121232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
133110121121232 is an abundant number, since it is smaller than the sum of its proper divisors (212096093552688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133110121121232 is a wasteful number, since it uses less digits than its factorization.
133110121121232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6158700 (or 6158694 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 133110121121232 its reverse (232121121011331), we get a palindrome (365231242132563).
The spelling of 133110121121232 in words is "one hundred thirty-three trillion, one hundred ten billion, one hundred twenty-one million, one hundred twenty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •