Base | Representation |
---|---|
bin | 111101011110100000… |
… | …1010000111111001111 |
3 | 110121202201101021222122 |
4 | 1322331001100333033 |
5 | 4130334140310211 |
6 | 140352124003155 |
7 | 12352404363545 |
oct | 1727501207717 |
9 | 417681337878 |
10 | 132020244431 |
11 | 50a97a93729 |
12 | 217053904bb |
13 | c5ac5b963a |
14 | 6565913d95 |
15 | 367a3c46db |
hex | 1ebd050fcf |
132020244431 has 4 divisors (see below), whose sum is σ = 132052037712. Its totient is φ = 131988451152.
The previous prime is 132020244397. The next prime is 132020244439. The reversal of 132020244431 is 134442020231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132020244431 - 230 = 130946502607 is a prime.
It is a super-2 number, since 2×1320202444312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132020244431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132020244439) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15890411 + ... + 15898716.
It is an arithmetic number, because the mean of its divisors is an integer number (33013009428).
Almost surely, 2132020244431 is an apocalyptic number.
132020244431 is a deficient number, since it is larger than the sum of its proper divisors (31793281).
132020244431 is an equidigital number, since it uses as much as digits as its factorization.
132020244431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31793280.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 132020244431 its reverse (134442020231), we get a palindrome (266462264662).
The spelling of 132020244431 in words is "one hundred thirty-two billion, twenty million, two hundred forty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •