Base | Representation |
---|---|
bin | 11110000010110001000110… |
… | …011010100001011100100001 |
3 | 122022211122122021021101000200 |
4 | 132002301012122201130201 |
5 | 114304320411121031001 |
6 | 1145004222024335413 |
7 | 36555122054332344 |
oct | 3602610632413441 |
9 | 568748567241020 |
10 | 132131555252001 |
11 | 39112750305a78 |
12 | 1299bb92614569 |
13 | 5895c4bc8a126 |
14 | 248b2b68c045b |
15 | 10420a1bea086 |
hex | 782c466a1721 |
132131555252001 has 24 divisors (see below), whose sum is σ = 190949316467520. Its totient is φ = 88044958695456.
The previous prime is 132131555251991. The next prime is 132131555252009. The reversal of 132131555252001 is 100252555131231.
132131555252001 is a `hidden beast` number, since 1 + 3 + 2 + 1 + 31 + 55 + 52 + 520 + 0 + 1 = 666.
It is not a de Polignac number, because 132131555252001 - 27 = 132131555251873 is a prime.
It is a super-2 number, since 2×1321315552520012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (132131555252009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 301645020 + ... + 302082738.
It is an arithmetic number, because the mean of its divisors is an integer number (7956221519480).
Almost surely, 2132131555252001 is an apocalyptic number.
It is an amenable number.
132131555252001 is a deficient number, since it is larger than the sum of its proper divisors (58817761215519).
132131555252001 is a wasteful number, since it uses less digits than its factorization.
132131555252001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 453925 (or 453922 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 132131555252001 in words is "one hundred thirty-two trillion, one hundred thirty-one billion, five hundred fifty-five million, two hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •