Base | Representation |
---|---|
bin | 1111110001100… |
… | …01001011100101 |
3 | 100012222122200121 |
4 | 13320301023211 |
5 | 232333301041 |
6 | 21044041541 |
7 | 3164501326 |
oct | 770611345 |
9 | 305878617 |
10 | 132322021 |
11 | 68768547 |
12 | 383932b1 |
13 | 2154c670 |
14 | 1380644d |
15 | b93b7d1 |
hex | 7e312e5 |
132322021 has 4 divisors (see below), whose sum is σ = 142500652. Its totient is φ = 122143392.
The previous prime is 132322007. The next prime is 132322031. The reversal of 132322021 is 120223231.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 24453025 + 107868996 = 4945^2 + 10386^2 .
It is a cyclic number.
It is not a de Polignac number, because 132322021 - 211 = 132319973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132321986 and 132322004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132322031) 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, 5089296 + ... + 5089321.
It is an arithmetic number, because the mean of its divisors is an integer number (35625163).
Almost surely, 2132322021 is an apocalyptic number.
It is an amenable number.
132322021 is a deficient number, since it is larger than the sum of its proper divisors (10178631).
132322021 is a wasteful number, since it uses less digits than its factorization.
132322021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10178630.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 132322021 is about 11503.1309216230. The cubic root of 132322021 is about 509.5780451941.
Adding to 132322021 its reverse (120223231), we get a palindrome (252545252).
The spelling of 132322021 in words is "one hundred thirty-two million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •