Base | Representation |
---|---|
bin | 11110000100001101101101… |
… | …110110101101011011000001 |
3 | 122100012011022211100222020210 |
4 | 132010031231312231123001 |
5 | 114312433042301402241 |
6 | 1145122030000224333 |
7 | 36565242323053002 |
oct | 3604155566553301 |
9 | 570164284328223 |
10 | 132231001200321 |
11 | 39150941a16921 |
12 | 129b730690b0a9 |
13 | 58a2439a6b12a |
14 | 249202c1191a9 |
15 | 1044972491316 |
hex | 78436ddad6c1 |
132231001200321 has 4 divisors (see below), whose sum is σ = 176308001600432. Its totient is φ = 88154000800212.
The previous prime is 132231001200253. The next prime is 132231001200323. The reversal of 132231001200321 is 123002100132231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 132231001200321 - 211 = 132231001198273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132231001200323) 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, 22038500200051 + ... + 22038500200056.
It is an arithmetic number, because the mean of its divisors is an integer number (44077000400108).
Almost surely, 2132231001200321 is an apocalyptic number.
It is an amenable number.
132231001200321 is a deficient number, since it is larger than the sum of its proper divisors (44077000400111).
132231001200321 is an equidigital number, since it uses as much as digits as its factorization.
132231001200321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44077000400110.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 132231001200321 its reverse (123002100132231), we get a palindrome (255233101332552).
The spelling of 132231001200321 in words is "one hundred thirty-two trillion, two hundred thirty-one billion, one million, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •