Base | Representation |
---|---|
bin | 11110000010101111101011… |
… | …110000101101010010010011 |
3 | 122022211111201021102002101000 |
4 | 132002233223300231102103 |
5 | 114304304302242403021 |
6 | 1145003411054113043 |
7 | 36555036265652460 |
oct | 3602575360552223 |
9 | 568744637362330 |
10 | 132130034341011 |
11 | 3911203a843043 |
12 | 1299b8291ab783 |
13 | 5895a68b55bb5 |
14 | 248b1b08d6667 |
15 | 104201341eb26 |
hex | 782bebc2d493 |
132130034341011 has 32 divisors (see below), whose sum is σ = 223825271155200. Its totient is φ = 75464724517920.
The previous prime is 132130034341001. The next prime is 132130034341037. The reversal of 132130034341011 is 110143430031231.
132130034341011 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 300 + 3 + 4 + 341 + 0 + 11 = 666.
It is not a de Polignac number, because 132130034341011 - 213 = 132130034332819 is a prime.
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 (132130034341001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 176255760 + ... + 177003821.
It is an arithmetic number, because the mean of its divisors is an integer number (6994539723600).
Almost surely, 2132130034341011 is an apocalyptic number.
132130034341011 is a deficient number, since it is larger than the sum of its proper divisors (91695236814189).
132130034341011 is a wasteful number, since it uses less digits than its factorization.
132130034341011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 353261576 (or 353261570 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 132130034341011 its reverse (110143430031231), we get a palindrome (242273464372242).
The spelling of 132130034341011 in words is "one hundred thirty-two trillion, one hundred thirty billion, thirty-four million, three hundred forty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •