Base | Representation |
---|---|
bin | 111101110110111110… |
… | …0100111101110000010 |
3 | 110200212220222121102000 |
4 | 1323231330213232002 |
5 | 4134024311013102 |
6 | 141005410004430 |
7 | 12411632544030 |
oct | 1735574475602 |
9 | 420786877360 |
10 | 132841110402 |
11 | 51379386460 |
12 | 218b4276716 |
13 | c6b0696b50 |
14 | 6602951550 |
15 | 36c74be01c |
hex | 1eedf27b82 |
132841110402 has 128 divisors (see below), whose sum is σ = 396355921920. Its totient is φ = 31850003520.
The previous prime is 132841110401. The next prime is 132841110431. The reversal of 132841110402 is 204011148231.
It is a super-2 number, since 2×1328411104022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (132841110401) 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 63 ways as a sum of consecutive naturals, for example, 1174728 + ... + 1282835.
It is an arithmetic number, because the mean of its divisors is an integer number (3096530640).
Almost surely, 2132841110402 is an apocalyptic number.
132841110402 is an abundant number, since it is smaller than the sum of its proper divisors (263514811518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132841110402 is a wasteful number, since it uses less digits than its factorization.
132841110402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457605 (or 2457599 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 132841110402 its reverse (204011148231), we get a palindrome (336852258633).
The spelling of 132841110402 in words is "one hundred thirty-two billion, eight hundred forty-one million, one hundred ten thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •