Base | Representation |
---|---|
bin | 11110000010100110100111… |
… | …101011001010011011011001 |
3 | 122022210120121000111010120221 |
4 | 132002212213223022123121 |
5 | 114304124334314232413 |
6 | 1144555121234320041 |
7 | 36554243152205464 |
oct | 3602464753123331 |
9 | 568716530433527 |
10 | 132120302102233 |
11 | 391089a6192aa5 |
12 | 12999971a29021 |
13 | 5894b77789523 |
14 | 248a92a1542db |
15 | 1041b43d0368d |
hex | 7829a7aca6d9 |
132120302102233 has 16 divisors (see below), whose sum is σ = 133104058637760. Its totient is φ = 131139125216064.
The previous prime is 132120302102221. The next prime is 132120302102249. The reversal of 132120302102233 is 332201203021231.
It is a cyclic number.
It is not a de Polignac number, because 132120302102233 - 221 = 132120300005081 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132120302102198 and 132120302102207.
It is not an unprimeable number, because it can be changed into a prime (132120302192233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 964573810 + ... + 964710772.
It is an arithmetic number, because the mean of its divisors is an integer number (8319003664860).
Almost surely, 2132120302102233 is an apocalyptic number.
It is an amenable number.
132120302102233 is a deficient number, since it is larger than the sum of its proper divisors (983756535527).
132120302102233 is a wasteful number, since it uses less digits than its factorization.
132120302102233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146328.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 132120302102233 its reverse (332201203021231), we get a palindrome (464321505123464).
The spelling of 132120302102233 in words is "one hundred thirty-two trillion, one hundred twenty billion, three hundred two million, one hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •