Base | Representation |
---|---|
bin | 1001011111011110000… |
… | …11001110001000010100 |
3 | 1011011210210001101211022 |
4 | 10233233003032020110 |
5 | 20320410041134012 |
6 | 405453513100312 |
7 | 32363612000633 |
oct | 4575703161024 |
9 | 1134723041738 |
10 | 326133146132 |
11 | 116348727832 |
12 | 532593b7698 |
13 | 249a604caa1 |
14 | 11adbbb551a |
15 | 873bab3472 |
hex | 4bef0ce214 |
326133146132 has 24 divisors (see below), whose sum is σ = 600840088800. Its totient is φ = 154466506656.
The previous prime is 326133146117. The next prime is 326133146147. The reversal of 326133146132 is 231641331623.
It is an interprime number because it is at equal distance from previous prime (326133146117) and next prime (326133146147).
It is a super-2 number, since 2×3261331461322 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 326133146092 and 326133146101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 438719 + ... + 919097.
It is an arithmetic number, because the mean of its divisors is an integer number (25035003700).
Almost surely, 2326133146132 is an apocalyptic number.
It is an amenable number.
326133146132 is a deficient number, since it is larger than the sum of its proper divisors (274706942668).
326133146132 is a wasteful number, since it uses less digits than its factorization.
326133146132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489335 (or 489333 counting only the distinct ones).
The product of its digits is 46656, while the sum is 35.
Adding to 326133146132 its reverse (231641331623), we get a palindrome (557774477755).
The spelling of 326133146132 in words is "three hundred twenty-six billion, one hundred thirty-three million, one hundred forty-six thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •