Base | Representation |
---|---|
bin | 11110000011000011011111… |
… | …010100010110001000111111 |
3 | 122022220112121100021122002100 |
4 | 132003003133110112020333 |
5 | 114310131330401303223 |
6 | 1145021245212000143 |
7 | 36556421263423335 |
oct | 3603033724261077 |
9 | 568815540248070 |
10 | 132151300416063 |
11 | 391200629a8a85 |
12 | 129a3983160053 |
13 | 5897a7791b166 |
14 | 248c22adcbb55 |
15 | 104285a3c9043 |
hex | 7830df51623f |
132151300416063 has 12 divisors (see below), whose sum is σ = 193573735821648. Its totient is φ = 86860009662720.
The previous prime is 132151300416061. The next prime is 132151300416077. The reversal of 132151300416063 is 360614003151231.
132151300416063 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 5 + 1 + 3 + 0 + 0 + 41 + 606 + 3 = 666.
It is not a de Polignac number, because 132151300416063 - 21 = 132151300416061 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132151300416061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 103404772770 + ... + 103404774047.
It is an arithmetic number, because the mean of its divisors is an integer number (16131144651804).
Almost surely, 2132151300416063 is an apocalyptic number.
132151300416063 is a deficient number, since it is larger than the sum of its proper divisors (61422435405585).
132151300416063 is a wasteful number, since it uses less digits than its factorization.
132151300416063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206809546894 (or 206809546891 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 36.
Adding to 132151300416063 its reverse (360614003151231), we get a palindrome (492765303567294).
The spelling of 132151300416063 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, three hundred million, four hundred sixteen thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •