Base | Representation |
---|---|
bin | 11110000011000010110110… |
… | …111000111100111000111111 |
3 | 122022220110212001222221122000 |
4 | 132003002312320330320333 |
5 | 114310123433232133421 |
6 | 1145021054022153343 |
7 | 36556365416265042 |
oct | 3603026670747077 |
9 | 568813761887560 |
10 | 132150622146111 |
11 | 3911a8450507a8 |
12 | 129a3813b82853 |
13 | 589799a2497aa |
14 | 248c1a4cacc59 |
15 | 104281aa9a226 |
hex | 7830b6e3ce3f |
132150622146111 has 16 divisors (see below), whose sum is σ = 195828681429600. Its totient is φ = 88077922884864.
The previous prime is 132150622146077. The next prime is 132150622146119. The reversal of 132150622146111 is 111641226051231.
132150622146111 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 5 + 0 + 6 + 22 + 14 + 611 + 1 = 666.
It is not a de Polignac number, because 132150622146111 - 29 = 132150622145599 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132150622146119) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 624666706 + ... + 624878223.
It is an arithmetic number, because the mean of its divisors is an integer number (12239292589350).
Almost surely, 2132150622146111 is an apocalyptic number.
132150622146111 is a deficient number, since it is larger than the sum of its proper divisors (63678059283489).
132150622146111 is a wasteful number, since it uses less digits than its factorization.
132150622146111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1249548855 (or 1249548849 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
Adding to 132150622146111 its reverse (111641226051231), we get a palindrome (243791848197342).
The spelling of 132150622146111 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred twenty-two million, one hundred forty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •