Base | Representation |
---|---|
bin | 111101101101101101… |
… | …0011001110000010111 |
3 | 110200002020212012111202 |
4 | 1323123122121300113 |
5 | 4132410204303143 |
6 | 140514501023115 |
7 | 12401135456126 |
oct | 1733332316027 |
9 | 420066765452 |
10 | 132530150423 |
11 | 512298a6640 |
12 | 218280b4a9b |
13 | c66112c568 |
14 | 65b3527abd |
15 | 36aa047ab8 |
hex | 1edb699c17 |
132530150423 has 8 divisors (see below), whose sum is σ = 149563806480. Its totient is φ = 116327404480.
The previous prime is 132530150411. The next prime is 132530150429. The reversal of 132530150423 is 324051035231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132530150423 - 26 = 132530150359 is a prime.
It is a super-2 number, since 2×1325301504232 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132530150429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 207727190 + ... + 207727827.
It is an arithmetic number, because the mean of its divisors is an integer number (18695475810).
Almost surely, 2132530150423 is an apocalyptic number.
132530150423 is a deficient number, since it is larger than the sum of its proper divisors (17033656057).
132530150423 is a wasteful number, since it uses less digits than its factorization.
132530150423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 415455057.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 132530150423 its reverse (324051035231), we get a palindrome (456581185654).
The spelling of 132530150423 in words is "one hundred thirty-two billion, five hundred thirty million, one hundred fifty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •