Base | Representation |
---|---|
bin | 11110000010111010000000… |
… | …101001010001010101101110 |
3 | 122022212120100000001012020222 |
4 | 132002322000221101111232 |
5 | 114310000004231200220 |
6 | 1145012443220011342 |
7 | 36555611122425635 |
oct | 3602720051212556 |
9 | 568776300035228 |
10 | 132141122131310 |
11 | 3911680a592aa6 |
12 | 129a1a02530b52 |
13 | 5896b1500a766 |
14 | 248b9432da51c |
15 | 1042461a50e25 |
hex | 782e80a5156e |
132141122131310 has 16 divisors (see below), whose sum is σ = 237854498058000. Its totient is φ = 52856342581056.
The previous prime is 132141122131303. The next prime is 132141122131363. The reversal of 132141122131310 is 13131221141231.
It is a super-2 number, since 2×1321411221313102 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132141122131310.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7959920 + ... + 18100899.
It is an arithmetic number, because the mean of its divisors is an integer number (14865906128625).
Almost surely, 2132141122131310 is an apocalyptic number.
132141122131310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132141122131310 is a deficient number, since it is larger than the sum of its proper divisors (105713375926690).
132141122131310 is a wasteful number, since it uses less digits than its factorization.
132141122131310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26567875.
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 132141122131310 its reverse (13131221141231), we get a palindrome (145272343272541).
The spelling of 132141122131310 in words is "one hundred thirty-two trillion, one hundred forty-one billion, one hundred twenty-two million, one hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •