Base | Representation |
---|---|
bin | 100100100010100101001011… |
… | …0000011100010110011001000 |
3 | 1120011000200210212221200220122 |
4 | 1021011022112003202303020 |
5 | 314112003440113441412 |
6 | 3055330402545042412 |
7 | 124462154316613553 |
oct | 11105122603426310 |
9 | 1504020725850818 |
10 | 321412100140232 |
11 | 93459119373242 |
12 | 3006b99a026408 |
13 | 10a460531197ba |
14 | 595260030769a |
15 | 27259edca6572 |
hex | 12452960e2cc8 |
321412100140232 has 32 divisors (see below), whose sum is σ = 645267187186200. Its totient is φ = 149553283866624.
The previous prime is 321412100140141. The next prime is 321412100140331. The reversal of 321412100140232 is 232041001214123.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 319506115570756 + 1905984569476 = 17874734^2 + 1380574^2 .
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, 13277090513 + ... + 13277114720.
Almost surely, 2321412100140232 is an apocalyptic number.
It is an amenable number.
321412100140232 is an abundant number, since it is smaller than the sum of its proper divisors (323855087045968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
321412100140232 is a wasteful number, since it uses less digits than its factorization.
321412100140232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26554205345 (or 26554205341 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 321412100140232 its reverse (232041001214123), we get a palindrome (553453101354355).
The spelling of 321412100140232 in words is "three hundred twenty-one trillion, four hundred twelve billion, one hundred million, one hundred forty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •