Base | Representation |
---|---|
bin | 11110000011000011010101… |
… | …001011000111001000010110 |
3 | 122022220112011111000221021020 |
4 | 132003003111023013020112 |
5 | 114310131003314120001 |
6 | 1145021220252102010 |
7 | 36556414126002120 |
oct | 3603032513071026 |
9 | 568815144027236 |
10 | 132151130223126 |
11 | 3911aa85924563 |
12 | 129a3936164906 |
13 | 5897a4b59c091 |
14 | 248c212568210 |
15 | 104284a4ab736 |
hex | 7830d52c7216 |
132151130223126 has 64 divisors (see below), whose sum is σ = 320169278886912. Its totient is φ = 35498512438272.
The previous prime is 132151130223121. The next prime is 132151130223197. The reversal of 132151130223126 is 621322031151231.
It is a happy number.
It is a super-2 number, since 2×1321511302231262 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132151130223121) 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, 98095986 + ... + 99434021.
It is an arithmetic number, because the mean of its divisors is an integer number (5002644982608).
Almost surely, 2132151130223126 is an apocalyptic number.
132151130223126 is an abundant number, since it is smaller than the sum of its proper divisors (188018148663786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132151130223126 is a wasteful number, since it uses less digits than its factorization.
132151130223126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197530973.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 132151130223126 its reverse (621322031151231), we get a palindrome (753473161374357).
The spelling of 132151130223126 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, one hundred thirty million, two hundred twenty-three thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •