Base | Representation |
---|---|
bin | 11110001010010111001110… |
… | …001001111010001111101010 |
3 | 122101200112221010212220001010 |
4 | 132022113032021322033222 |
5 | 114341343404023010242 |
6 | 1150044104254404350 |
7 | 36640620656413215 |
oct | 3612271611721752 |
9 | 571615833786033 |
10 | 132653523641322 |
11 | 392a4052909522 |
12 | 12a651848006b6 |
13 | 590323453ca28 |
14 | 24a86715b677c |
15 | 10509512b589c |
hex | 78a5ce27a3ea |
132653523641322 has 16 divisors (see below), whose sum is σ = 265989070545120. Its totient is φ = 44104170670032.
The previous prime is 132653523641273. The next prime is 132653523641333. The reversal of 132653523641322 is 223146325356231.
It is a happy number.
132653523641322 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1326535236413222 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28417633408 + ... + 28417638075.
It is an arithmetic number, because the mean of its divisors is an integer number (16624316909070).
Almost surely, 2132653523641322 is an apocalyptic number.
132653523641322 is an abundant number, since it is smaller than the sum of its proper divisors (133335546903798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132653523641322 is a wasteful number, since it uses less digits than its factorization.
132653523641322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56835271877.
The product of its digits is 4665600, while the sum is 48.
Adding to 132653523641322 its reverse (223146325356231), we get a palindrome (355799848997553).
The spelling of 132653523641322 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred twenty-three million, six hundred forty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •